Sciweavers

27 search results - page 4 / 6
» Normal forms for general polynomial matrices
Sort
View
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
13 years 9 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter
SIMPRA
2010
110views more  SIMPRA 2010»
13 years 5 months ago
Singularity-free dynamic equations of vehicle-manipulator systems
In this paper we derive the singularity-free dynamic equations of vehiclemanipulator systems using a minimal representation. These systems are normally modeled using Euler angles,...
Pål Johan From, Vincent Duindam, Kristin Ytt...
AAAI
2006
13 years 9 months ago
Compilation of Query-Rewriting Problems into Tractable Fragments of Propositional Logic
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...
Yolifé Arvelo, Blai Bonet, Maria-Esther Vid...
LICS
2002
IEEE
14 years 12 days ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
ICALP
2009
Springer
14 years 7 months ago
Limiting Negations in Formulas
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
Hiroki Morizumi