1020 search results - page 141 / 204 » Tight Semantics for Logic Programs |
101
click to vote
LPNMR
2001
Springer
15 years 4 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
106
click to vote
LPAR
2004
Springer
15 years 5 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
116
click to vote
ASP
2005
Springer
15 years 5 months ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
115
click to vote
INTERACTION
2009
ACM
15 years 6 months ago
2009
ACM
DTD and its instance have been considered the standard for data representation and information exchange format on the current web. However, when coming to the next generation of w...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. This paper presents an implementation of (a simplified version of) the cognitive agent programming language 3APL in the Maude term rewriting language. Maude is based on t...