191 search results - page 4 / 39 » Mappings Between Domain Models in Answer Set Programming |
156
Voted
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
186
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
As a novel, grand AI challenge, General Game Playing is concerned with the development of systems that understand the rules of unknown games and play these games well without human...
AAAI
2008
14 years 12 months ago
2008
One way to solve the knowledge acquisition bottleneck is to have ways to translate natural language sentences and discourses to a formal knowledge representation language, especia...
FOIKS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Ordered Choice Logic Programming (OCLP) allows for dynamic preference-based decision-making with multiple alternatives without the need for any form of negation. This com...
ICLP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Theoretical foundations and practical realizations of answer set solving techniques are vital research issues. The challenge lies in combining the elevated modeling capac...