Sciweavers

884 search results - page 15 / 177
» A Proof Theory for DL-Lite
Sort
View
CADE
2000
Springer
15 years 10 months ago
An Infrastructure for Intertheory Reasoning
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...
William M. Farmer
SIAMCOMP
2000
106views more  SIAMCOMP 2000»
15 years 5 months ago
Computationally Sound Proofs
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...
Silvio Micali
ISCIS
2004
Springer
15 years 11 months ago
Proof of the Basic Theorem on Concept Lattices in Isabelle/HOL
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...
Baris Sertkaya, Halit Oguztüzün
IANDC
2006
102views more  IANDC 2006»
15 years 6 months ago
Modular proof systems for partial functions with Evans equality
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...
Harald Ganzinger, Viorica Sofronie-Stokkermans, Uw...
MOC
1998
104views more  MOC 1998»
15 years 5 months ago
Chaos in the Lorenz equations: A computer assisted proof. Part II: Details
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...
Konstantin Mischaikow, Marian Mrozek