70 search results - page 5 / 14 » A Framework for Compiling Preferences in Logic Programs |
ISSTA
2004
ACM
14 years 1 months ago
2004
ACM
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
AI
2002
Springer
13 years 7 months ago
2002
Springer
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
In this paper we propose a type-based framework for using logic programming for XML processing. We transform XML documents into terms and DTDs into regular types. We implemented a ...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
Modeling objects using formal grammars has recently regained much attention in computer vision. Probabilistic logic programming, such as Bilattice based Logical Reasoning (BLR), i...
KR
2000
Springer
13 years 11 months ago
2000
Springer
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...