A new methodology for query answering in default logics via structure-oriented theorem proving

1995 ◽  
Vol 15 (1) ◽  
pp. 95-165 ◽  
Author(s):  
T. Schaub
Author(s):  
Markus Krötzsch

To reason with existential rules (a.k.a. tuple-generating dependencies), one often computes universal models. Among the many such models of different structure and cardinality, the core is arguably the “best”. Especially for finitely satisfiable theories, where the core is the unique smallest universal model, it has advantages in query answering, non-monotonic reasoning, and data exchange. Unfortunately, computing cores is difficult and not supported by most reasoners. We therefore propose ways of computing cores using practically implemented methods from rule reasoning and answer set programming. Our focus is on cases where the standard chase algorithm produces a core. We characterise this desirable situation in general terms that apply to a large class of cores, derive concrete approaches for decidable special cases, and generalise these approaches to non-monotonic extensions of existential rules.


1986 ◽  
Author(s):  
Martin Abadi ◽  
Zohar Manna
Keyword(s):  

2021 ◽  
pp. 1-15
Author(s):  
Geoff Sutcliffe

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 in the various competition divisions. This paper presents an outline of the competition design, and a commentated summary of the results.


Sign in / Sign up

Export Citation Format

Share Document