3658 search results - page 187 / 732 » The logic of proofs, semantically |
215
click to vote
DLOG
2009
15 years 4 months ago
2009
Abstract This paper analyzes the probabilistic description logic PSHIQ by looking at it as a fragment of probabilistic first-order logic with semantics based on possible worlds. We...
173
click to vote
STOC
1999
ACM
15 years 11 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
165
click to vote
ECCC
2007
15 years 6 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
227
click to vote
CSL
2007
Springer
16 years 23 days ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
196
click to vote
JELIA
2010
Springer
15 years 5 months ago
2010
Springer
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order form...