Constraint Answer Set Solving

DOI10.1007/978-3-642-02846-5_22zbMATH Open1251.68061OpenAlexW2096621306MaRDI QIDQ4649733FDOQ4649733

Authors Martin Gebser, Max Ostrowski, Torsten Schaub

Publication date 13 November 2012

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02846-5_22

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Constraint Satisfaction
• Solving set-valued constraint satisfaction problems
• Constraint answer set programming systems
• Solving quantified constraint satisfaction problems
• scientific article; zbMATH DE number 1688810
• Representing constraint satisfaction problems in answer set programming
• Principles and Practice of Constraint Programming – CP 2003
• Integrating Answer Set Reasoning with Constraint Solving Techniques
• Constraint solving with constraint handling rules

Cites work

• Answer set based design of knowledge systems
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Conflict-Driven Answer Set Enumeration
• Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
• Extending and implementing the stable model semantics
• External sources of knowledge and value invention in logic programming
• Handbook of constraint programming.
• Integrating Answer Set Reasoning with Constraint Solving Techniques
• Integrating answer set programming and constraint logic programming
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic Programming
• Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)

Cited in

(33)

• Stable model semantics for founded bounds
• A ``conservative approach to extending answer set programming with non-Herbrand functions
• Weight constraint programs with evaluable functions
• Conflict-Driven Answer Set Enumeration
• Answer set programming modulo acyclicity
• Principles and Practice of Constraint Programming – CP 2003
• Hybrid answer set programming
• Constraint answer set programming without grounding
• Integrating Answer Set Reasoning with Constraint Solving Techniques
• Constraint CNF: SAT and CSP Language Under One Roof.
• Modelling grammar constraints with answer set programming
• Representing constraint satisfaction problems in answer set programming
• A translational approach to constraint answer set solving
• System \textsc{aspmt2smt}: computing ASPMT theories by SMT solvers
• On abstract modular inference systems and solvers
• Answer set solving with lazy nogood generation
• Integrating answer set programming and constraint logic programming
• ASP modulo CSP: the clingcon system
• Detection and exploitation of functional dependencies for model generation
• Constraint answer set programming systems
• Domain expansion for ASP-programs with external sources
• A model building framework for answer set programming with external computations
• \textit{clingcon}: the next generation
• First-order stable model semantics with intensional functions
• Conflict generalisation in ASP: learning correct and effective non-ground constraints
• Inlining external sources in answer set programs
• Relating constraint answer set programming languages and algorithms
• aspartame: solving constraint satisfaction problems with answer set programming
• Clause-learning for modular systems
• Automated Reasoning
• Constraint answer set solver EZCSP and why integration schemas matter
• On relation between constraint answer set programming and satisfiability modulo theories
• Conflict-driven answer set solving: from theory to practice

Describes a project that uses

Uses Software

• Gringo
• DLV-EX
• Potassco
• clasp
• Clingcon
• Clingo
• iClingo

This page was built for publication: Constraint Answer Set Solving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649733)