Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleSeptember 2024
Revisiting block deordering in finite-domain state variable planning
Plan deordering removes unnecessary ordering constraints between actions in a plan, facilitating plan execution flexibility and several other tasks, such as plan reuse, modification, and decomposition. Block deordering is a variant of plan deordering ...
- research-articleJanuary 2021
The CADE-28 Automated Theorem Proving System Competition – CASC-28
The CADE ATP System Competition (CASC) is the annual evaluation of fully automatic, classical logic Automated Theorem Proving (ATP) systems. CASC-28 was the twenty-sixth competition in the CASC series. Twenty-two ATP systems competed in the various ...
- research-articleJanuary 2021
The 10th IJCAR automated theorem proving system competition – CASC-J10
The CADE ATP System Competition (CASC) is the annual evaluation of fully automatic, classical logic Automated Theorem Proving (ATP) systems. CASC-J10 was the twenty-fifth competition in the CASC series. Twenty-four ATP systems and system variants competed ...
- research-articleJanuary 2019
The CADE-27 Automated theorem proving System Competition – CASC-27
The CADE ATP System Competition (CASC) is the annual evaluation of fully automatic, classical logic Automated Theorem Proving (ATP) systems. CASC-27 was the twenty-fourth competition in the CASC series. Twenty-five ATP systems and system variants competed ...
- research-articleJanuary 2017
The CADE-26 automated theorem proving system competition – CASC-26
The CADE ATP System Competition (CASC) is the annual evaluation of fully automatic, classical logic Automated Theorem Proving (ATP) systems. CASC-26 was the twenty-second competition in the CASC series. Twenty-one ATP systems and system variants competed ...
- research-articleJanuary 2016
The CADE-25 Automated Theorem Proving system competition – CASC-25
The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, classical logic Automated Theorem Proving (ATP) systems. CASC-25 was the twentieth competition in the CASC series. Twenty-seven ATP systems and system variants competed in ...
- research-articleSeptember 2015
The 7th IJCAR automated theorem proving system competition – CASC-J7
AbstractThe CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, classical logic Automated Theorem Proving (ATP) systems. CASC-J7 was the nineteenth competition in the CASC series. Twenty-four ATP systems and system ...
- articleApril 2010
Practical algorithms for unsatisfiability proof and core generation in SAT solvers
AI Communications (AICO), Volume 23, Issue 2-3Pages 145–157Since Zhang and Malik's work in 2003 [19], it is well-known that modern DPLL-based SAT solvers with learning can be instrumented to write a trace on disk from which, if the input is unsatisfiable, a resolution proof can be extracted (and checked), and ...
- articleJanuary 2006
The CADE-20 automated theorem proving competition
AI Communications (AICO), Volume 19, Issue 2Pages 173–181The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first order Automated Theorem Proving systems. CASC-20 was the tenth competition in the CASC series. Seventeen ATP systems and system variants competed in the various ...
- articleJune 2003
Complexity of argument-based default reasoning with specificity
AI Communications (AICO), Volume 16, Issue 2Pages 107–119In this paper we investigate the complexity of Dung and Son's approach to default reasoning with specificity. We show that the three decision problems: existence of extensions, brave reasoning and cautious reasoning are generally complete for the second ...
- articleApril 2003
Complexity of argument-based default reasoning with specificity
AI Communications (AICO), Volume 16, Issue 2Pages 107–119In this paper we investigate the complexity of Dung and Son's approach to default reasoning with specificity. We show that the three decision problems: existence of extensions, brave reasoning and cautious reasoning are generally complete for the second ...
- articleDecember 1999
Informational logic in knowledge representation and automated deduction
AI Communications (AICO), Volume 12, Issue 4Pages 185–208Informational logic is a new approach to the formalization of the notion of rational conjecture that is of interest both from the epistemic and the automated reasoning point of view. Given a logical system $T$, an informational logic is based on a new ...