Sciweavers

2022 search results - page 58 / 405
» Complexity of Non-Monotonic Logics
Sort
View
106
Voted
CSFW
2008
IEEE
15 years 7 months ago
An Authorization Logic With Explicit Time
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...
Henry DeYoung, Deepak Garg, Frank Pfenning
97
Voted
ICALP
2005
Springer
15 years 6 months ago
Logics for Unranked Trees: An Overview
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...
Leonid Libkin
ISMVL
1994
IEEE
124views Hardware» more  ISMVL 1994»
15 years 4 months ago
Approximating Propositional Calculi by Finite-Valued Logics
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...
Matthias Baaz, Richard Zach
197
Voted
AIML
2008
15 years 2 months ago
Topology, connectedness, and modal logic
This paper presents a survey of topological spatial logics, taking as its point of departure the interpretation of the modal logic S4 due to McKinsey and Tarski. We consider the ef...
Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter...
ATAL
2010
Springer
15 years 1 months ago
On the logic of argumentation theory
The paper applies modal logic to formalize fragments of argumentation theory. Such formalization allows to import, for free, a wealth of new notions (e.g., argument equivalence), ...
Davide Grossi