2585 search results - page 241 / 517 » Automating Coherent Logic |
179
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Automated theorem provers (ATPs) struggle to solve problems with large sets of possibly superfluous axiom. Several algorithms have been developed to reduce the number of ...
165
click to vote
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
164
click to vote
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
190
click to vote
DLOG
2011
14 years 10 months ago
2011
This paper introduces relaxed abduction, a novel non-standard reasoning task for description logics. Although abductive reasoning over description logic knowledge bases has been ap...
212
click to vote
VMCAI
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...