Sciweavers

174 search results - page 24 / 35
» Existential Fixed-Point Logic
Sort
View
FOSSACS
2008
Springer
14 years 11 months ago
What Else Is Decidable about Integer Arrays?
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the first-order fragment and allows (1) Presburger constraints on existentially...
Peter Habermehl, Radu Iosif, Tomás Vojnar
SYNTHESE
2008
88views more  SYNTHESE 2008»
14 years 10 months ago
Interpolation in computing science: the semantics of modularization
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...
Gerard R. Renardel de Lavalette
LICS
2005
IEEE
15 years 3 months ago
Proof-Theoretic Approach to Description-Logic
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
Martin Hofmann
IJCAI
2007
14 years 11 months ago
Recursive Random Fields
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
Daniel Lowd, Pedro Domingos
POPL
2010
ACM
15 years 7 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...