On the Complexity of the Bernays-Schönfinkel Class with Datalog

DOI10.1007/978-3-642-16242-8_14zbMath1307.03019OpenAlexW1517830222MaRDI QIDQ4933305

Piotr Witkowski, Witold Charatonik

Publication date: 12 October 2010

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16242-8_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic programming (68N17)

Related Items (3)

Two-Variable Logic with Counting and Trees ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates ⋮ An Efficient Decision Procedure for Imperative Tree Data Structures

Uses Software

• Datalog

This page was built for publication: On the Complexity of the Bernays-Schönfinkel Class with Datalog