Sciweavers

232 search results - page 36 / 47
» Completeness and Decidability in Sequence Logic
Sort
View
DAC
2004
ACM
14 years 8 months ago
Refining the SAT decision ordering for bounded model checking
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
Chao Wang, HoonSang Jin, Gary D. Hachtel, Fabio So...
ATAL
2006
Springer
13 years 11 months ago
Temporal qualitative coalitional games
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
IJCAI
2003
13 years 8 months ago
Automated Reasoning: Past Story and New Trends
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
Andrei Voronkov
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 9 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
NAR
2000
172views more  NAR 2000»
13 years 7 months ago
The Molecular Biology Database Collection: an online compilation of relevant database resources
The Molecular Biology Database Collection represents an effort geared at making molecular biology database resources more accessible to biologists. This online resource, available...
Andreas D. Baxevanis