Sciweavers

144 search results - page 14 / 29
» Complexity Results for Modal Dependence Logic
Sort
View
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
13 years 5 months ago
Reduction of interpolants for logic synthesis
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
John D. Backes, Marc D. Riedel
AAAI
2010
13 years 9 months ago
Past and Future of DL-Lite
We design minimal temporal description logics that are capable of expressing various aspects of temporal conceptual data models and investigate their computational complexity. We ...
Alessandro Artale, Roman Kontchakov, Vladislav Ryz...
LOGCOM
2008
110views more  LOGCOM 2008»
13 years 7 months ago
Sum and Product in Dynamic Epistemic Logic
The Sum-and-Product riddle was first published in [Fre69]. We provide an overview on the history of the dissemination of this riddle through the academic and puzzle-math community...
Hans P. van Ditmarsch, Ji Ruan, Rineke Verbrugge
ICALP
2010
Springer
14 years 8 days ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
ATAL
2010
Springer
13 years 7 months ago
Verifying agents with memory is harder than it seemed
ATL+ is a variant of alternating-time temporal logic that does not have the expressive power of full ATL , but still allows for expressing some natural properties of agents. It ha...
Nils Bulling, Wojciech Jamroga