Approximating the Stable Model Semantics Is Hard

Fundamenta Informaticae - Netherlands
doi 10.3233/fi-1996-281207
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IOS Press

Related search

Stable Model Semantics for Founded Bounds

Theory and Practice of Logic Programming
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceArtificial IntelligenceSoftware
2013English

Approximating Good Simultaneous Diophantine Approximations Is Almost NP-hard

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

A Complete Axiomatic Semantics for the CSP Stable-Failures Model

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Psychiatry Is Hard

CMAJ
Medicine
2006English

Is Relevance Hard Work?

2013English

Fair Redistricting Is Hard

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

Computing the Interleaving Distance Is NP-Hard

Foundations of Computational Mathematics
MathematicsComputational MathematicsApplied MathematicsAnalysisComputational Theory
2019English

Template Semantics for Model-Based Notations

IEEE Transactions on Software Engineering
Software
2003English

The Academic Caesar: University Leadership Is Hard

2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy