Sciweavers

1391 search results - page 22 / 279
» Completeness of Neighbourhood Logic
Sort
View
AIIA
2003
Springer
14 years 2 months ago
A Complete Subsumption Algorithm
Abstract. Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of ...
Stefano Ferilli, Nicola Di Mauro, Teresa Maria Alt...
ELP
1993
14 years 1 months ago
Definitional Reflection and the Completion
The logic of definitional reflection is extended with a theory of free equality. Based on this equality theory a sequent-style notion of the completion of a definition is motivated...
Peter Schroeder-Heister
CONCUR
2004
Springer
14 years 2 months ago
Modular Construction of Modal Logics
We present a modular approach to defining logics for a wide variety of state-based systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavi...
Corina Cîrstea, Dirk Pattinson
CALCO
2011
Springer
235views Mathematics» more  CALCO 2011»
12 years 9 months ago
On the Fusion of Coalgebraic Logics
Fusion is arguably the simplest way to combine modal logics. For normal modal logics with Kripke semantics, many properties such as completeness and decidability are known to trans...
Fredrik Dahlqvist, Dirk Pattinson
PODS
2004
ACM
117views Database» more  PODS 2004»
14 years 9 months ago
Conditional XPath, the First Order Complete XPath Dialect
XPath is the W3C?standard node addressing language for XML documents. XPath is still under development and its technical aspects are intensively studied. What is missing at presen...
Maarten Marx