Logic programming with satisfiability
From MaRDI portal
Recommendations
Cited in
(16)- Tableau reasoning for description logics and its extension to probabilities
- Reasoning with logic programming
- Logic programming: laxness and saturation
- Eliminating models during model elimination
- Iterative and core-guided maxsat solving: a survey and assessment
- Logic programming with solution preferences
- Abstract interpretation of microcontroller code: intervals meet congruences
- scientific article; zbMATH DE number 4011898 (Why is no real title available?)
- scientific article; zbMATH DE number 25191 (Why is no real title available?)
- Boolean lexicographic optimization: algorithms \& applications
- scientific article; zbMATH DE number 1337623 (Why is no real title available?)
- A pearl on SAT and SMT solving in Prolog
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions
- Proving Termination with (Boolean) Satisfaction
- Transfer function synthesis without quantifier elimination
- Solving satisfiability problems with preferences
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)