Logic programs with stable model semantics as a constraint programming paradigm
From MaRDI portal
Publication:1978008
DOI10.1023/A:1018930122475zbMATH Open0940.68018DBLPjournals/amai/Niemela99WikidataQ60061161 ScholiaQ60061161MaRDI QIDQ1978008FDOQ1978008
Publication date: 7 June 2000
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 1368933
- A note on the stable model semantics for logic programs
- Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
- The Stable Models of a Predicate Logic Program
- Expressiveness of logic programs under the general stable model semantics
- The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
- On stable-like semantics for logic programs
- scientific article; zbMATH DE number 1114052
- Stable models and their computation for logic programming with inheritance and true negation
- scientific article; zbMATH DE number 2084772
Cited In (only showing first 100 items - show all)
- Title not available (Why is that?)
- Logic programming with infinite sets
- Modeling biological networks by action languages via answer set programming
- Compiling problem specifications into SAT
- A note on the stable model semantics for logic programs
- The Design of the Sixth Answer Set Programming Competition
- My work with Victor Marek: a mathematician looks at answer set programming
- Answer Set Programming: A Primer
- Some (in)translatability results for normal logic programs and propositional theories
- XSB: extending Prolog with tabled logic programming
- Ordered completion for first-order logic programs on finite structures
- Revisiting Explicit Negation in Answer Set Programming
- A modeling layer for constraint-programming libraries
- On abstract modular inference systems and solvers
- From answer set logic programming to circumscription via logic of GK
- Loop formulas for description logic programs
- Disjunctive logic programs with existential quantification in rule heads
- Strong order equivalence
- An approach from answer set programming to decision making in a railway interlocking system
- Answer Set Programming without Unstratified Negation
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
- How to fake an RSA signature by encoding modular root finding as a SAT problem
- Stable models and circumscription
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- A compositional typed higher-order logic with definitions
- Achievements in answer set programming
- Extending and implementing the stable model semantics
- Stable models and difference logic
- Transition systems for model generators—A unifying approach
- Answer set programming based on propositional satisfiability
- The Seventh Answer Set Programming Competition: Design and Results
- Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
- Evaluating ASP and commercial solvers on the CSPLib
- Integrating answer set programming and constraint logic programming
- On the relation among answer set solvers
- Fuzzy answer set computation via satisfiability modulo theories
- A translational approach to constraint answer set solving
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
- Backdoors to Normality for Disjunctive Logic Programs
- Answer set programming and plan generation
- Constraint answer set solver EZCSP and why integration schemas matter
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning
- Aggregated fuzzy answer set programming
- A general framework for preferences in answer set programming
- Possibilistic uncertainty handling for answer set programming
- Conflict-driven answer set solving: from theory to practice
- Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
- Fuzzy answer sets approximations
- Ordered completion for logic programs with aggregates
- Extending Removed Sets Revision to partially preordered belief bases
- Autoepistemic answer set programming
- Lparse Programs Revisited: Semantics and Representation of Aggregates
- The loop formula based semantics of description logic programs
- Backdoors to Satisfaction
- Answer set programming as a modeling language for course timetabling
- The complexity of recursive constraint satisfaction problems
- ASSAT: computing answer sets of a logic program by SAT solvers
- Nonmonotonic causal theories
- FLP answer set semantics without circular justifications for general logic programs
- Backdoors to tractable answer set programming
- Weight constraint programs with evaluable functions
- On the parameterized complexity of non-monotonic logics
- Logic programming and knowledge representation---The A-Prolog perspective
- Title not available (Why is that?)
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
- Extended RDF: computability and complexity issues
- Thirteen Definitions of a Stable Model
- Learning discrete decomposable graphical models via constraint optimization
- Title not available (Why is that?)
- Abduction in logic programming: A new definition and an abductive procedure based on rewriting
- Heuristic planning: A declarative approach based on strategies for action selection
- Conflict-driven ASP solving with external sources
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Contributions to the stable model semantics of logic programs with negation
- Infinitary equilibrium logic and strongly equivalent logic programs
- Generating explanations for biomedical queries
- Equilibrium graphs
- Temporal equilibrium logic: a survey
- Temporal Here and There
- A model building framework for answer set programming with external computations
- Formalizing Negotiations Using Logic Programming
- On the relation between SPARQL1.1 and Answer Set Programming
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
- Automata and Answer Set Programming
- Relativized hyperequivalence of logic programs for modular programming
- Logic programs with abstract constraint atoms: the role of computations
- Causal Logic Programming
- Connecting First-Order ASP and the Logic FO(ID) through Reducts
- Stepwise debugging of answer-set programs
- Stable-unstable semantics: Beyond NP with normal logic programs
- The dramatic true story of the frame default
- Answer Set Programming and Planning with Knowledge and World-Altering Actions in Multiple Agent Domains
- Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
- Automated reformulation of specifications by safe delay of constraints
- Temporal Equilibrium Logic with past operators
- Title not available (Why is that?)
- Modular Answer Set Programming as a Formal Specification Language
- Title not available (Why is that?)
- Strongly Equivalent Temporal Logic Programs
- A denotational semantics for equilibrium logic
Uses Software
This page was built for publication: Logic programs with stable model semantics as a constraint programming paradigm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978008)
