149 search results - page 11 / 30 » Encoding Planning Problems in Nonmonotonic Logic Programs |
LANMR
2004
13 years 11 months ago
2004
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...
IJCAI
2003
13 years 11 months ago
2003
In rule-based systems, goal-oriented computations correspond naturally to the possible ways that an observation may be explained. In some applications, we need to compute explanat...
ICTAI
2002
IEEE
14 years 2 months ago
2002
IEEE
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
CP
2007
Springer
14 years 4 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
LPNMR
2007
Springer
14 years 3 months ago
2007
Springer
This paper gives a summary of the First Answer Set Programming System Competition that was held in conjunction with the Ninth International Conference on Logic Programming and Nonm...