Sciweavers

769 search results - page 71 / 154
» Is Logic all in our Heads
Sort
View
COCO
2003
Springer
114views Algorithms» more  COCO 2003»
15 years 6 months ago
Bounded Nondeterminism and Alternation in Parameterized Complexity Theory
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
Yijia Chen, Jörg Flum, Martin Grohe
108
Voted
KR
2010
Springer
15 years 5 months ago
Status QIO: Conjunctive Query Entailment Is Decidable
Description Logics (DLs) are knowledge representation formalisms that provide, for example, the logical underpinning of the W3C OWL standards. Conjunctive queries (CQs), the stand...
Birte Glimm, Sebastian Rudolph
119
Voted
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 5 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
CAISE
2009
Springer
15 years 4 months ago
Data-Flow Anti-patterns: Discovering Data-Flow Errors in Workflows
Despite the abundance of analysis techniques to discover control-flow errors in workflow designs, there is hardly any support for w verification. Most techniques simply abstract fr...
Nikola Trcka, Wil M. P. van der Aalst, Natalia Sid...
85
Voted
KBSE
2008
IEEE
15 years 7 months ago
Automatic Inference of Frame Axioms Using Static Analysis
Many approaches to software verification are currently semi-automatic: a human must provide key logical insights — e.g., loop invariants, class invariants, and frame axioms tha...
Zvonimir Rakamaric, Alan J. Hu