121 search results - page 9 / 25 » Elimination of Negation in a Logical Framework |
DLOG
2009
13 years 5 months ago
2009
Abstract. Generalized closed world reasoning allows for the assumption of a specified maximal set of negated atomic assertions retaining the consistency of an indefinite knowledge ...
CSFW
2008
IEEE
14 years 1 months ago
2008
IEEE
We present an authorization logic that permits reasoning with explicit time. Following a proof-theoretic approach, we study the meta-theory of the logic, including cut elimination...
SLP
1994
13 years 8 months ago
1994
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
MFCS
2004
Springer
14 years 22 days ago
2004
Springer
A binary language-theoretic operation is proposed, which is dual to the concatenation of languages in the same sense as the universal quantifier in logic is dual to the existenti...
LFCS
1992
Springer
13 years 11 months ago
1992
Springer
This paper addresses the problem of extending the formulae-as-types principle to classical logic. More precisely, we introduce a typed lambda-calculus (-LK ) whose inhabited types...