498 search results - page 17 / 100 » Constraint Answer Set Programming Systems |
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...
CP
2007
Springer
14 years 3 months ago
2007
Springer
Defence trees and CP-net (ceteris paribus network) are two useful approaches that can be used to help a system administrator to analyze a security scenario and to give him a model ...
LPNMR
1999
Springer
14 years 1 months ago
1999
Springer
This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action langua...
LPNMR
2007
Springer
14 years 2 months ago
2007
Springer
We describe BE, an implemented system for solving belief change problems in the presence of actions. We illustrate how we can use BE to compute the result of belief progression, be...
AAAI
2006
13 years 10 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...