Writing declarative specifications for clauses

DOI10.1007/978-3-319-48758-8_17MaRDI QIDQ2835876zbMATH OpenOpenAlexFDO

Authors Martin Gebser, Tomi Janhunen, Roland Kaminski, Torsten Schaub, Shahab Tasharrofi

Publication date 30 November 2016

Published in Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-48758-8_17

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27) Computational aspects of satisfiability (68R07)

Recommendations

• Compiling problem specifications into SAT
• scientific article; zbMATH DE number 1692953
• Theory and Applications of Satisfiability Testing
• A pearl on SAT and SMT solving in Prolog
• Clause elimination for SAT and QSAT

Cites work

• scientific article; zbMATH DE number 5139161 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 6747915 (Why is no real title available?)
• Cardinality networks: a theoretical and empirical study
• Compiling \(\mathrm{input}^\ast\) FO\((\cdot)\) inductive definitions into tabled prolog rules for IDP3
• Compiling problem specifications into SAT
• Concise finite-domain representations for PDDL planning tasks
• Efficient Haplotype Inference with Pseudo-boolean Optimization
• Extending and implementing the stable model semantics
• Grounding FO and FO(ID) with bounds
• Modeling machine learning and data mining problems with \(\mathrm{FO}(\cdot )\)
• Proof Systems for Effectively Propositional Logic
• SAT modulo graphs: acyclicity
• Some (in)translatability results for normal logic programs and propositional theories
• Stable-unstable semantics: Beyond NP with normal logic programs
• The DLV system for knowledge representation and reasoning
• The expressive powers of the logic programming semantics
• The well-founded semantics for general logic programs
• Tools for modeling and solving search problems
• Unsatisfiability-based optimization in clasp
• Writing declarative specifications for clauses

Cited in

(5)

• Compiling problem specifications into SAT
• Joining specification statements
• Writing declarative specifications for clauses
• scientific article; zbMATH DE number 1692953 (Why is no real title available?)
• What is answer set programming to propositional satisfiability

Describes a project that uses

Uses Software

• MiniZinc
• RPOLY
• Gringo
• MiniSat

This page was built for publication: Writing declarative specifications for clauses

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