Sciweavers

155 search results - page 23 / 31
» Non-Determinism in Deductive Databases
Sort
View
PODS
2005
ACM
136views Database» more  PODS 2005»
14 years 10 months ago
Context-sensitive program analysis as database queries
Program analysis has been increasingly used in software engineering tasks such as auditing programs for security vulnerabilities and finding errors in general. Such tools often re...
Monica S. Lam, John Whaley, V. Benjamin Livshits, ...
DEXA
2004
Springer
108views Database» more  DEXA 2004»
14 years 3 months ago
Identifying Audience Preferences in Legal and Social Domains
Reasoning in legal and social domains appears not to be well dealt with by deductive approaches. This is because such reasoning is open-endedly defeasible, and because the various ...
Paul E. Dunne, Trevor J. M. Bench-Capon
KR
2010
Springer
14 years 2 months ago
Walking the Decidability Line for Rules with Existential Variables
We consider positive rules in which the conclusion may contain existentially quantified variables, which makes reasoning tasks (such as Deduction) undecidable. These rules have t...
Jean-François Baget, Michel LeClere, Marie-...
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
14 years 2 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...
ICTL
1994
14 years 1 months ago
Abduction in Temporal Reasoning
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
Cristina Ribeiro, António Porto