Sciweavers

33 search results - page 2 / 7
» Modal Logics Between Propositional and First-order
Sort
View
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 4 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel
LOGCOM
2002
124views more  LOGCOM 2002»
13 years 5 months ago
Modal Logics Between Propositional and First-order
One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if...
Melvin Fitting
AISC
1998
Springer
13 years 10 months ago
Optimising Propositional Modal Satisfiability for Description Logic Subsumption
Effective optimisation techniques can make a dramatic difference in the performance of knowledge representation systems based on expressive description logics. Because of the corre...
Ian Horrocks, Peter F. Patel-Schneider
LICS
2009
IEEE
14 years 24 days ago
The Structure of First-Order Causality
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
Samuel Mimram
FROCOS
2007
Springer
14 years 9 days ago
Idempotent Transductions for Modal Logics
Abstract. We investigate the extension of modal logics by bisimulation quantifiers and present a class of modal logics which is decidable when augmented with bisimulation quanti...
Tim French