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)
Cited In (only showing first 100 items - show all)
- 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
- Anytime answer set optimization via unsatisfiable core shrinking
- On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
- CASP solutions for planning in hybrid domains
- Anytime Computation of Cautious Consequences in Answer Set Programming
- Improving the Normalization of Weight Rules in Answer Set Programs
- Quo Vadis Answer Set Programming?
- Relativized Hyperequivalence of Logic Programs for Modular Programming
- Cautious reasoning in ASP via minimal models and unsatisfiable cores
- Temporal logic programs with variables
- Exploiting functional dependencies in declarative problem specifications
- Consistency properties and set based logic programming
- Inductive situation calculus
- Set based logic programming
- Justifications for logic programs under answer set semantics
- Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach
- Applications of Action Languages in Cognitive Robotics
- Representing first-order causal theories by logic programs
- Model reconciliation in logic programs
- Three-valued semantics for hybrid MKNF knowledge bases revisited
- A constraint optimization approach to causal discovery from subsampled time series data
- Causal effect identification in acyclic directed mixed graphs and gated models
- D-FLAT: Declarative problem solving using tree decompositions and answer-set programming
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications
- A progression semantics for first-order logic programs
- Arguing correctness of ASP programs with aggregates
- Determining inference semantics for disjunctive logic programs
- Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination
- Syntactic ASP forgetting with forks
- Semantics for conditional literals via the SM operator
- What is answer set programming to propositional satisfiability
- Performance Tuning in Answer Set Programming
- Complexity results for answer set programming with bounded predicate arities and implications
- Logic programming for finding models in the logics of knowledge and its applications: A case study
- 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
Uses Software
Recommendations
- Title not available (Why is that?) ๐ ๐
- 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 ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Stable models and their computation for logic programming with inheritance and true negation ๐ ๐
- Title not available (Why is that?) ๐ ๐
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)