An Approximative Inference Method for Solving ∃∀SO Satisfiability Problems

Hanne Vlaeminck, Joost Vennekens, Marc Denecker, Maurice Bruynooghe

JAIR 2012 pp. 79-124

doi:10.1613/JAIR.3658 /jair/2012/vlaeminck2012jair-approximative/

Abstract

This paper considers the fragment ∃∀SO of second-order logic. Many interesting problems, such as conformant planning, can be naturally expressed as finite domain satisfiability problems of this logic. Such satisfiability problems are computationally hard (Σ

PDF JAIR Semantic Scholar

Cite

Text

Vlaeminck et al. "An Approximative Inference Method for Solving ∃∀SO Satisfiability Problems." Journal of Artificial Intelligence Research, 2012. doi:10.1613/JAIR.3658

Markdown

[Vlaeminck et al. "An Approximative Inference Method for Solving ∃∀SO Satisfiability Problems." Journal of Artificial Intelligence Research, 2012.](https://mlanthology.org/jair/2012/vlaeminck2012jair-approximative/) doi:10.1613/JAIR.3658

BibTeX

@article{vlaeminck2012jair-approximative,
  title     = {{An Approximative Inference Method for Solving ∃∀SO Satisfiability Problems}},
  author    = {Vlaeminck, Hanne and Vennekens, Joost and Denecker, Marc and Bruynooghe, Maurice},
  journal   = {Journal of Artificial Intelligence Research},
  year      = {2012},
  pages     = {79-124},
  doi       = {10.1613/JAIR.3658},
  volume    = {45},
  url       = {https://mlanthology.org/jair/2012/vlaeminck2012jair-approximative/}
}