Sciweavers

291 search results - page 16 / 59
» On the Complexity of Fragments of Modal Logics
Sort
View
CIE
2008
Springer
13 years 9 months ago
Herbrand Theorems and Skolemization for Prenex Fuzzy Logics
Approximate Herbrand theorems are established for first-order fuzzy logics based on continuous t-norms, and used to provide proof-theoretic proofs of Skolemization for their Prenex...
Matthias Baaz, George Metcalfe
ECAI
1992
Springer
13 years 11 months ago
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
Ilkka Niemelä, Jussi Rintanen
AIML
2008
13 years 9 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...
LFCS
2007
Springer
14 years 1 months ago
Reasoning About Sequences of Memory States
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
Rémi Brochenin, Stéphane Demri, &Eac...
NDJFL
2002
83views more  NDJFL 2002»
13 years 7 months ago
Shortest Axiomatizations of Implicational S4 and S5
Shortest possible axiomatizations for the implicational fragments of the modal logics S4 and S5 are reported. Among these axiomatizations is included a shortest single axiom for im...
Zachary Ernst, Branden Fitelson, Kenneth Harris, L...