417 search results - page 25 / 84 » Results on Reasoning about Updates in Transaction Logic |
123
Voted
LICS
1999
IEEE
15 years 4 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
104
click to vote
JELIA
2010
Springer
14 years 11 months ago
2010
Springer
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order form...
111
click to vote
ENTCS
2006
15 years 15 days ago
2006
We refine our algebraic axiomatization in [8,9] of epistemic actions and epistemic update (notions defined in [5,6] using Kripke-style semantics), to incorporate a mechanism for d...
111
click to vote
ESWS
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we describe a web-based tool that supports the human in revising ontology alignments. Our tool uses logical reasoning as a basis for detecting conflicts in mappings ...
100
Voted
FOSSACS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...