Pages that link to "Item:Q3502709"
From MaRDI portal
The following pages link to SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions (Q3502709):
Displaying 10 items.
- On abstract modular inference systems and solvers (Q286083) (← links)
- Relating constraint answer set programming languages and algorithms (Q490456) (← links)
- Design and results of the Fifth Answer Set Programming Competition (Q899444) (← links)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- Connecting First-Order ASP and the Logic FO(ID) through Reducts (Q2900547) (← links)
- A Formal Theory of Justifications (Q3449209) (← links)
- The Design of the Sixth Answer Set Programming Competition (Q3449235) (← links)
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with<i>IDP3</i> (Q4593015) (← links)
- Debugging for Model Expansion (Q5325763) (← links)
