An approximative inference method for solving ∃∀SO satisfiability problems

DOI10.1613/JAIR.3658MaRDI QIDQ3143568zbMATH OpenOpenAlexFDO

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

Publication date 3 December 2012

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.3658

zbMATH Keywords

\(\exists \forall \mathrm{SO}\)approximative methodinductive definitionsatisfiabilitysecond-order logic

Mathematics Subject Classification ID

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 \(\exists \forall \)SO satisfiability problems
• An exact algorithm for the constraint satisfaction problem: Application to logical inference
• Approximating satisfiable satisfiability problems (extended abstract)
• Approximating satisfiable satisfiability problems
• scientific article; zbMATH DE number 5575002
• Approximate satisfiability and equivalence
• An exact and a randomized approach for the satisfiability problem
• An algorithm for approximating the satisfiability problem of high-level conditions
• scientific article; zbMATH DE number 1222558
• Logics for approximating implication problems of saturated conditional independence

Cited in

(1)

• An approximative inference method for solving \(\exists \forall \)SO satisfiability problems

This page was built for publication: An approximative inference method for solving ∃∀SO satisfiability problems

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