Planning with Effectively Propositional Logic

DOI10.1007/978-3-642-37651-1_13zbMath1383.68086OpenAlexW199467017MaRDI QIDQ4916083

Andrei Voronkov, Juan Antonio Navarro Pérez

Publication date: 19 April 2013

Published in: Programming Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-37651-1_13

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (2)

What is answer set programming to propositional satisfiability ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates

Uses Software

• TPTP

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity of resolution proofs and function introduction
• STRIPS: A new approach to the application of theorem proving to problem solving
• The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
• Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
• Theory Instantiation
• Automated Deduction – CADE-20

This page was built for publication: Planning with Effectively Propositional Logic