Logic programming with satisfiability
From MaRDI portal
Publication:5437652
DOI10.1017/S1471068407003146zbMath1128.68014OpenAlexW2049460548MaRDI QIDQ5437652
Peter J. Stuckey, V. Lagoon, Michael Codish
Publication date: 21 January 2008
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068407003146
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Related Items
Eliminating models during model elimination ⋮ Tableau reasoning for description logics and its extension to probabilities ⋮ Solving satisfiability problems with preferences ⋮ Boolean lexicographic optimization: algorithms \& applications ⋮ A pearl on SAT and SMT solving in Prolog ⋮ Abstract interpretation of microcontroller code: intervals meet congruences ⋮ A SAT-Based Approach to Size Change Termination with Global Ranking Functions ⋮ Transfer Function Synthesis without Quantifier Elimination ⋮ Proving Termination with (Boolean) Satisfaction ⋮ Iterative and core-guided maxsat solving: a survey and assessment
Uses Software
Cites Work
