Sciweavers

884 search results - page 25 / 177
» A Proof Theory for DL-Lite
Sort
View
MLQ
1998
61views more  MLQ 1998»
14 years 11 months ago
Extracting Algorithms from Intuitionistic Proofs
This paper presents a new method – which does not rely on the cut-elimination theorem – for characterizing the provably total functions of certain intuitionistic subsystems of ...
Fernando Ferreira, António Marques
ENTCS
2010
105views more  ENTCS 2010»
14 years 12 months ago
From Focalization of Logic to the Logic of Focalization
Focalization property is a deep outcome of linear logic proof theory, putting to the foreground the role of polarity in logic. It resulted an important advances in various fields, ...
Michele Basaldella, Alexis Saurin, Kazushige Terui
CADE
2010
Springer
15 years 28 days ago
Sledgehammer: Judgement Day
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS a...
Sascha Böhme, Tobias Nipkow
JSYML
2002
81views more  JSYML 2002»
14 years 11 months ago
Group Configurations and Germs in Simple Theories
We develop the theory of germs of generic functions in simple theories. Starting with an algebraic quadrangle (or other similar hypotheses), we obtain an "almost" generic...
Itay Ben-Yaacov
INFORMATICALT
2010
91views more  INFORMATICALT 2010»
14 years 10 months ago
An Expansion of the Neural Network Theory by Introducing Hebb Postulate
In the presented paper, some issues of the fundamental classical mechanics theory in the sense of Ising physics are introduced into the applied neural network area. The expansion o...
Algis Garliauskas