754 search results - page 65 / 151 » An Ordered Logic Program Solver |
114
click to vote
FOIKS
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This pro...
111
click to vote
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
Separation logic involves two dual forms of modularity: local reasoning makes part of the store invisible within a static scope, whereas hiding local state makes part of the store...
AGP
1999
IEEE
15 years 5 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 ...
109
Voted
AAAI
1994
15 years 2 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
121
click to vote
FUIN
2010
14 years 11 months ago
2010
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...