33 search results - page 5 / 7 » Naming Proofs in Classical Propositional Logic |
CSL
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ļ...
LICS
2008
IEEE
14 years 5 days ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
IGPL
2006
13 years 5 months ago
2006
Abstract. This paper addresses the problem of establishing temporal properties of programs written in languages, such as Java, that make extensive use of the heap to allocate-and d...
MLQ
2010
13 years 4 months ago
2010
This article systematically investigates so-called ātruth variantsā of several functional interpretations. We start by showing a close relation between two variants of modiļ¬...
ALT
2004
Springer
14 years 2 months ago
2004
Springer
Probabilistic inductive logic programming, sometimes also called statistical relational learning, addresses one of the central questions of artiļ¬cial intelligence: the integratio...