884 search results - page 15 / 177 » A Proof Theory for DL-Lite |
CADE
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. The little theories method, in which mathematical reasoning is distributed across a network of theories, is a powerful technique for describing and analyzing complex syst...
101
click to vote
SIAMCOMP
2000
14 years 11 months ago
2000
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
106
click to vote
ISCIS
2004
Springer
15 years 5 months ago
2004
Springer
This paper presents a machine-checked proof of the Basic Theorem on Concept Lattices, which appears in the book “Formal Concept Analysis” by Ganter and Wille, in the Isabelle/H...
IANDC
2006
14 years 11 months ago
2006
The paper presents a modular superposition calculus for the combination of firstorder theories involving both total and partial functions. The modularity of the calculus is a cons...
MOC
1998
14 years 11 months ago
1998
Abstract. Details of a new technique for obtaining rigorous results concerning the global dynamics of nonlinear systems is described. The technique abstract existence results based...