Planning with effectively propositional logic

DOI10.1007/978-3-642-37651-1_13MaRDI QIDQ4916083zbMATH OpenOpenAlexFDO

Authors Andrei Voronkov, Juan Antonio 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)

Recommendations

• Proof Systems for Effectively Propositional Logic
• AI*IA 2003: Advances in Artificial Intelligence
• scientific article; zbMATH DE number 1705165
• Planning as satisfiability: parallel plans and algorithms for plan search
• The logic of totally and partially ordered plans: A deductive database approach

Cites work

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

Cited in

(8)

• What is answer set programming to propositional satisfiability
• Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
• A lightweight epistemic logic and its application to planning
• Intelligent Backtracking in Plan-Based Deduction
• Planning as tabled logic programming
• Decision-Theoretic Planning with Fuzzy Notions in GOLOG
• Logic Programming and Nonmonotonic Reasoning
• Concise finite-domain representations for PDDL planning tasks

Describes a project that uses

Uses Software

• TPTP

This page was built for publication: Planning with effectively propositional logic

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