Logic programs with stable model semantics as a constraint programming paradigm

DOI10.1023/A:1018930122475MaRDI QIDQ1978008zbMATH OpenDBLPWikidataFDO

Authors Ilkka Niemelä

Publication date 7 June 2000

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

logic progrmming

Mathematics Subject Classification ID

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

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)

• Answers set programs for non-transferable utility games: expressiveness, complexity and applications
• \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
• Generating explanations for biomedical queries
• Causal Logic Programming
• Temporal here and there
• The Seventh Answer Set Programming Competition: Design and Results
• Automata and Answer Set Programming
• Complexity results for answer set programming with bounded predicate arities and implications
• D-FLAT: declarative problem solving using tree decompositions and answer-set programming
• Representing first-order causal theories by logic programs
• Answer set programming and planning with knowledge and world-altering actions in multiple agent domains
• On the relation between SPARQL1.1 and Answer Set Programming
• Model reconciliation in logic programs
• Equilibrium graphs
• Consistency properties and set based logic programming
• Inductive situation calculus
• Set based logic programming
• Connecting first-order ASP and the logic FO(ID) through reducts
• Anytime computation of cautious consequences in answer set programming
• On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
• Improving the normalization of weight rules in answer set programs
• Modular answer set programming as a formal specification language
• Cautious reasoning in ASP via minimal models and unsatisfiable cores
• Relativized hyperequivalence of logic programs for modular programming
• Formalizing negotiations using logic programming
• CASP solutions for planning in hybrid domains
• Automated reformulation of specifications by safe delay of constraints
• A progression semantics for first-order logic programs
• Design and results of the Fifth Answer Set Programming Competition
• Temporal equilibrium logic: a survey
• Applications of action languages in cognitive robotics
• A model building framework for answer set programming with external computations
• Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
• Exploiting functional dependencies in declarative problem specifications
• What is answer set programming to propositional satisfiability
• Logic programs with abstract constraint atoms: the role of computations
• 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
• Quo Vadis Answer Set Programming?
• Relativized Hyperequivalence of Logic Programs for Modular Programming
• The dramatic true story of the frame default
• Temporal logic programs with variables
• Performance tuning in answer set programming
• Strongly Equivalent Temporal Logic Programs
• scientific article; zbMATH DE number 1696768 (Why is no real title available?)
• Arguing correctness of ASP programs with aggregates
• Temporal equilibrium logic with past operators
• Determining inference semantics for disjunctive logic programs
• Logic programming for finding models in the logics of knowledge and its applications: a case study
• Justifications for logic programs under answer set semantics
• Finding optimal plans for multiple teams of robots through a mediator: a logic-based approach
• A denotational semantics for equilibrium logic
• Anytime answer set optimization via unsatisfiable core shrinking
• 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
• Stable-unstable semantics: Beyond NP with normal logic programs
• scientific article; zbMATH DE number 7455713 (Why is no real title available?)
• Backdoors to tractable answer set programming
• Weight constraint programs with evaluable functions
• Aggregated fuzzy answer set programming
• scientific article; zbMATH DE number 2088041 (Why is no real title available?)
• Backdoors to satisfaction
• On the parameterized complexity of non-monotonic logics
• A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
• Compiling problem specifications into SAT
• Autoepistemic answer set programming
• ASSAT: computing answer sets of a logic program by SAT solvers
• Abduction in logic programming: A new definition and an abductive procedure based on rewriting
• A modeling layer for constraint-programming libraries
• scientific article; zbMATH DE number 1884395 (Why is no real title available?)
• How to fake an RSA signature by encoding modular root finding as a SAT problem
• Achievements in answer set programming
• A compositional typed higher-order logic with definitions
• Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
• Transition systems for model generators -- a unifying approach
• Evaluating ASP and commercial solvers on the CSPLib
• The loop formula based semantics of description logic programs
• XSB: extending Prolog with tabled logic programming
• Extending Removed Sets Revision to partially preordered belief bases
• A translational approach to constraint answer set solving
• On abstract modular inference systems and solvers
• Thirteen Definitions of a Stable Model
• Disjunctive logic programs with existential quantification in rule heads
• Stable models and circumscription
• Integrating answer set programming and constraint logic programming
• On the relation among answer set solvers
• From answer set logic programming to circumscription via logic of GK
• Extended RDF: computability and complexity issues
• Ordered completion for first-order logic programs on finite structures
• Extending and implementing the stable model semantics
• Logic programming with infinite sets
• Revisiting explicit negation in answer set programming
• Contributions to the stable model semantics of logic programs with negation
• Backdoors to normality for disjunctive logic programs
• Heuristic planning: A declarative approach based on strategies for action selection
• Stable models and difference logic
• Answer set programming based on propositional satisfiability
• The Design of the Sixth Answer Set Programming Competition

Describes a project that uses

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)