CSL
2001
Springer
14 years 2 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 ļ...
CSL
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. In this paper we show how to extend a constructive type theory with a principle that captures the spirit of Markovās principle from constructive recursive mathematics. ...
CSL
2001
Springer
14 years 2 months ago
2001
Springer
We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of m...
CSL
2001
Springer
14 years 2 months ago
2001
Springer
We prove an existential version of Gaifmanās locality theorem and show how it can be applied algorithmically to evaluate existential ļ¬rst-order sentences in ļ¬nite structures....
CSL
2001
Springer
14 years 2 months ago
2001
Springer
Hyper tableau reasoning is a version of clausal form tableau reasoning where all negative literals in a clause are resolved away in a single inference step. Constrained hyper table...
CSL
2001
Springer
14 years 2 months ago
2001
Springer
We reveal a symmetric structure in the ho/n games model of innocent strategies, introducing rigid strategies, a concept dual to bracketed strategies. We prove a direct deļ¬nabilit...
CSL
2001
Springer
14 years 2 months ago
2001
Springer
We show in this paper a special extended logic, partition logic based on so called partition quantiļ¬ers, is able to capture some important complexity classes NP, P and NL by its ...
CSL
2001
Springer
14 years 2 months ago
2001
Springer
In this paper, we introduce decidable multimodal logics to describe and reason about navigation across object structures. The starting point of these navigation logics is the model...
CSL
2001
Springer
14 years 2 months ago
2001
Springer
We show how a well-known superposition-based inference system for ļ¬rst-order equational logic can be used almost directly as a decision procedure for various theories including l...
CSL
2001
Springer
14 years 2 months ago
2001
Springer
In this paper we investigate the purely logical rule of term induction, i.e. induction deriving numerals instead of arbitrary terms. In this system it is not possible to bound the ...