Writing Declarative Specifications for Clauses

DOI10.1007/978-3-319-48758-8_17zbMath1483.68378OpenAlexW2546121331MaRDI QIDQ2835876

Torsten Schaub, Martin Gebser, Roland Kaminski, Tomi Janhunen, 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 in artificial intelligence (68T27) Logic programming (68N17) Computational aspects of satisfiability (68R07)

Related Items (2)

What is answer set programming to propositional satisfiability ⋮ Writing Declarative Specifications for Clauses

Uses Software

• MiniSat
• Gringo
• RPOLY
• MiniZinc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cardinality networks: a theoretical and empirical study
• Concise finite-domain representations for PDDL planning tasks
• Extending and implementing the stable model semantics
• The expressive powers of the logic programming semantics
• Compiling problem specifications into SAT
• Writing Declarative Specifications for Clauses
• SAT Modulo Graphs: Acyclicity
• Proof Systems for Effectively Propositional Logic
• Grounding FO and FO(ID) with Bounds
• Some (in)translatability results for normal logic programs and propositional theories
• The well-founded semantics for general logic programs
• Stable-unstable semantics: Beyond NP with normal logic programs
• The DLV system for knowledge representation and reasoning
• Unsatisfiability-based optimization in clasp
• Compiling Input* FO(·) inductive definitions into tabled prolog rules for IDP3
• Efficient Haplotype Inference with Pseudo-boolean Optimization

This page was built for publication: Writing Declarative Specifications for Clauses