Sciweavers

2062 search results - page 22 / 413
» Derivatives of Logical Formulas
Sort
View
IJCAI
2003
13 years 11 months ago
Quantifying information and contradiction in propositional logic through test actions
Degrees of information and of contradiction are investigated within a uniform propositional framework, based on test actions. We consider that the degree of information of a propo...
Sébastien Konieczny, Jérôme La...
CORR
2010
Springer
125views Education» more  CORR 2010»
13 years 9 months ago
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
Mikolaj Bojanczyk, Luc Segoufin
FMCO
2005
Springer
14 years 3 months ago
Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
We present a method for decomposing modal formulas for processes with the internal action τ. To decide whether a process algebra term satisfies a modal formula, one can check whe...
Wan Fokkink, Rob J. van Glabbeek, Paulien de Wind
CSL
2005
Springer
14 years 3 months ago
The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order l...
Bruno Courcelle, Christian Delhommé
FMCAD
2007
Springer
14 years 3 months ago
Lifting Propositional Interpolants to the Word-Level
— Craig interpolants are often used to approximate inductive invariants of transition systems. Arithmetic relationships between numeric variables require word-level interpolants,...
Daniel Kroening, Georg Weissenbacher