Extending and implementing the stable model semantics
From MaRDI portal
Publication:1603743
DOI10.1016/S0004-3702(02)00187-XzbMath0995.68021MaRDI QIDQ1603743
Ilkka Niemelä, Patrik Simons, Timo Soininen
Publication date: 15 July 2002
Published in: Artificial Intelligence (Search for Journal in Brave)
68N17: Logic programming
Related Items
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets, Answer Set Programming without Unstratified Negation, Detecting Inconsistencies in Large Biological Networks with Answer Set Programming, On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP, Lparse Programs Revisited: Semantics and Representation of Aggregates, Computable Functions in ASP: Theory and Implementation, Removing Redundancy from Answer Set Programs, Logic programming with infinite sets, A first order nonmonotonic extension of constructive logic, Reasoning with infinite stable models, Answer set based design of knowledge systems, Equilibrium logic, Answer set programming based on propositional satisfiability, Modeling biological networks by action languages via answer set programming, Logic programs with abstract constraint atoms: the role of computations, My work with Victor Marek: a mathematician looks at answer set programming, On the relation among answer set solvers, Integrating answer set programming and constraint logic programming, The theory of interval probabilistic logic programs, Computing only minimal answers in disjunctive deductive databases, Logic programming and knowledge representation---The A-Prolog perspective, Answer set programming and plan generation, Abduction in logic programming: A new definition and an abductive procedure based on rewriting, Maintenance goals of agents in a dynamic environment: formulation and policy construction, Heuristics for planning with penalties and rewards formulated in logic and computed through circuits, On look-ahead heuristics in disjunctive logic programming, Enhancing DLV instantiator by backjumping techniques, An incremental algorithm for generating all minimal models, External sources of knowledge and value invention in logic programming, Abductive reasoning in neural-symbolic systems, Inferring phylogenetic trees using answer set programming, Characterising equilibrium logic and nested logic programs: Reductions and complexity,, Characterizations of stable model semantics for logic programs with arbitrary constraint atoms, $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols, Qualitative Constraint Enforcement in Advanced Policy Specification, Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs, atalog: A logic language for expressing search and optimization problems, A translational approach to constraint answer set solving, A program-level approach to revising logic programs under the answer set semantics, Testing and debugging techniques for answer set solver development, Automata and Answer Set Programming, Justifications for logic programs under answer set semantics, Probabilistic reasoning with answer sets, Dealing Automatically with Exceptions by Introducing Specificity in ASP, Towards a Type Discipline for Answer Set Programming, Some (in)translatability results for normal logic programs and propositional theories
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semantical considerations on nonmonotonic logic
- The complexity of optimization problems
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- Lexicographic priorities in default logic
- LOGIDATA+: deductive databases with complex objects
- An alternative approach to the semantics of disjunctive logic programs and deductive databases
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Computing with default logic
- A constraint-based approach to narrow search trees for satisfiability
- On the computational cost of disjunctive logic programming: Propositional case
- Logic programs with stable model semantics as a constraint programming paradigm
- Default reasoning using classical logic
- A rational reconstruction of nonmonotonic truth maintenance systems
- Experimental results on the crossover point in random 3-SAT
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- The well-founded semantics for general logic programs
- Mixed integer programming methods for computing nonmonotonic deductive databases
- SATO: An efficient propositional prover
- A machine program for theorem-proving
- Verifying security protocols as planning in logic programming
- On computing logic programs
