529 search results - page 12 / 106 » Simple Random Logic Programs |
AAAI
2004
13 years 11 months ago
2004
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...
FGR
2011
IEEE
13 years 1 months ago
2011
IEEE
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
SERP
2003
13 years 11 months ago
2003
Design patterns provide a medium-grained ion and can be used as an effective tool for understanding object-oriented systems. This paper presents a simple tool for the extraction o...
AAAI
1994
13 years 11 months ago
1994
In this paper we consider updates that are specified as rules and consider simple knowledge bases consisting of ground atoms. We present a translation of the rule based update spe...
LPNMR
1999
Springer
14 years 2 months ago
1999
Springer
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...