Logic programs with stable model semantics as a constraint programming paradigm

DOI10.1023/A:1018930122475zbMATH Open0940.68018DBLPjournals/amai/Niemela99WikidataQ60061161 ScholiaQ60061161MaRDI QIDQ1978008FDOQ1978008

Authors: Ilkka Niemelä 

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

zbMATH Keywords

logic progrmming

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Cited In (only showing first 100 items - show all)

• Generating explanations for biomedical queries
• Equilibrium graphs
• Temporal equilibrium logic: a survey
• A model building framework for answer set programming with external computations
• D-FLAT: declarative problem solving using tree decompositions and answer-set 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
• Stable-unstable semantics: Beyond NP with normal logic programs
• Anytime computation of cautious consequences in answer set programming
• Improving the normalization of weight rules in answer set programs
• The dramatic true story of the frame default
• Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
• Automated reformulation of specifications by safe delay of constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Applications of action languages in cognitive robotics
• Strongly Equivalent Temporal Logic Programs
• The Seventh Answer Set Programming Competition: Design and Results
• Formalizing negotiations using logic programming
• 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
• 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
• Design and results of the Fifth Answer Set Programming Competition
• Performance tuning in answer set programming
• Justifications for logic programs under answer set semantics
• Logic programming for finding models in the logics of knowledge and its applications: a case study
• 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
• Answers set programs for non-transferable utility games: expressiveness, complexity and applications
• Modular answer set programming as a formal specification language
• A progression semantics for first-order logic programs
• Arguing correctness of ASP programs with aggregates
• Determining inference semantics for disjunctive logic programs
• Temporal equilibrium logic with past operators
• Temporal here and there
• 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
• Connecting first-order ASP and the logic FO(ID) through reducts
• Finding optimal plans for multiple teams of robots through a mediator: a logic-based approach
• Answer set programming and planning with knowledge and world-altering actions in multiple agent domains
• Complexity results for answer set programming with bounded predicate arities and implications
• Title not available (Why is that?)
• Transition systems for model generators -- a unifying approach
• 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
• 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
• Answer set programming based on propositional satisfiability
• 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
• Backdoors to satisfaction
• A translational approach to constraint answer set solving
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• On logical constraints in logic programming
• 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

• NP-SPEC
• Smodels
• Graphplan

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)