Logic programming with satisfiability
From MaRDI portal
Publication:5437652
DOI10.1017/S1471068407003146zbMATH Open1128.68014OpenAlexW2049460548MaRDI QIDQ5437652FDOQ5437652
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)
Cites Work
Cited In (16)
- Title not available (Why is that?)
- Logic programming: laxness and saturation
- Abstract interpretation of microcontroller code: intervals meet congruences
- Solving satisfiability problems with preferences
- Boolean lexicographic optimization: algorithms \& applications
- A pearl on SAT and SMT solving in Prolog
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions
- Title not available (Why is that?)
- Eliminating models during model elimination
- Tableau reasoning for description logics and its extension to probabilities
- Reasoning with logic programming
- Iterative and core-guided maxsat solving: a survey and assessment
- Transfer Function Synthesis without Quantifier Elimination
- Proving Termination with (Boolean) Satisfaction
- Logic programming with solution preferences
- Title not available (Why is that?)
Uses Software
This page was built for publication: Logic programming with satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5437652)
