454 search results - page 39 / 91 » Representation results for defeasible logic |
DAC
2003
ACM
14 years 9 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
AI
2001
Springer
14 years 9 days ago
2001
Springer
The stable semantics has become a prime candidate for knowledge representation and reasoning. The rules associated with propositional logic programs and the stable semantics are no...
DAGSTUHL
1998
13 years 10 months ago
1998
Deductive database technology represents an important step towards the goal of developing highly-declarative database programming languages. In order to make deductive databases a ...
LPNMR
2009
Springer
14 years 3 months ago
2009
Springer
Modular nonmonotonic logic programs (MLPs) under the answer-set semantics have been recently introduced as an ASP formalism in which modules can receive context-dependent input fro...
LICS
2005
IEEE
14 years 2 months ago
2005
IEEE
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions g...