Logics in Artificial Intelligence

DOI10.1007/B100483zbMATH Open1111.68656OpenAlexW335252711MaRDI QIDQ5394151FDOQ5394151

Authors: Nicolas Peltier 

Publication date: 25 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100483

Recommendations

• scientific article; zbMATH DE number 1765699
• scientific article; zbMATH DE number 1113860
• scientific article; zbMATH DE number 1189105
• Satisfiability, branch-width and Tseitin tautologies
• A fast saturation strategy for set-theoretic tableaux
• Free-variable tableaux for monotonic preorders
• Deciding \(\mathsf {ATL}^*\) satisfiability by tableaux
• A SAT approach to branchwidth
• A SAT approach to branchwidth
• Branching rules for satisfiability

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Cited In (5)

• Title not available (Why is that?)
• Saturation Up to Redundancy for Tableau and Sequent Calculi
• Liberalized variable splitting
• Depth-first proof search without backtracking for free-variable clausal tableaux
• Tableau methods for a logic with term declarations

Uses Software

• KeY
• leanTAP

This page was built for publication: Logics in Artificial Intelligence

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