764 search results - page 117 / 153 » On the Expressibility of Stable Logic Programming |
AGP
1999
IEEE
15 years 4 months ago
1999
IEEE
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
108
click to vote
FUIN
2008
14 years 12 months ago
2008
Abstract. The ability to recognize human activities from sensory information is essential for developing the next generation of smart devices. Many human activity recognition tasks...
122
click to vote
RR
2010
Springer
14 years 9 months ago
2010
Springer
The Accountability In RDF (AIR) language is an N3-based, Semantic Web production rule language that supports nested activation of rules, negation, closed world reasoning, scoped co...
EGC
2005
Springer
15 years 5 months ago
2005
Springer
We are concerned with the following problem: How do we allow a community of users to access and process diverse data stored in many different formats? Standard data formats and da...
ISSTA
2004
ACM
15 years 5 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...