An approximative inference method for solving SO satisfiability problems

DOI10.1007/978-3-642-15675-5_28MaRDI QIDQ4930775zbMATH OpenOpenAlexFDO

Authors Hanne Vlaeminck, Johan Wittocx, Joost Vennekens, Marc Denecker, Maurice Bruynooghe

Publication date 1 October 2010

Published in Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/123456789/279721

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27)

Recommendations

• An approximative inference method for solving ∃∀SO satisfiability problems
• Logic Programming and Nonmonotonic Reasoning
• SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
• New methods for computing inferences in first order logic
• Partial instantiation methods for inference in first-order logic

Cited in

(4)

• Solution lifting method for handling meta-variables in TH\(\exists\)OREM\(\forall\)
• An approximative inference method for solving ∃∀SO satisfiability problems
• scientific article; zbMATH DE number 1962835 (Why is no real title available?)
• Efficient solution of a class of quantified constraints with quantifier prefix exists-forall

This page was built for publication: An approximative inference method for solving \(\exists \forall \)SO satisfiability problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4930775)