Sciweavers

2035 search results - page 51 / 407
» On the complexity of stratified logics
Sort
View
ISMVL
1994
IEEE
124views Hardware» more  ISMVL 1994»
15 years 10 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
AIML
2008
15 years 7 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 7 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
JAIR
2007
121views more  JAIR 2007»
15 years 6 months ago
On the Semantics of Logic Programs with Preferences
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
Sergio Greco, Irina Trubitsyna, Ester Zumpano
COLING
1990
15 years 7 months ago
CLG(n): Constraint Logic Grammars
: CLG(2) is the latest member of a family of grammar formalisms centered around the notion of complex constraint expression for describing phrasal and iexical information and princ...
Sergio Balari, Giovanni B. Varile, Luís Dam...