Writing declarative specifications for clauses

DOI10.1007/978-3-319-48758-8_17zbMATH Open1483.68378OpenAlexW2546121331MaRDI QIDQ2835876FDOQ2835876

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Compiling problem specifications into SAT
• Joining specification statements
• Writing declarative specifications for clauses
• Title not available (Why is that?)
• What is answer set programming to propositional satisfiability

Uses Software

• MiniSat
• Gringo
• RPOLY
• MiniZinc

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)