7868 search results - page 334 / 1574 » Learning by Answer Sets |
167
click to vote
ASP
2003
Springer
15 years 12 months ago
2003
Springer
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
147
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
166
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
175
Voted
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Very large scale networks such as the Internet require a new operational model to use resources efficiently and reduce the need for the administration necessary in clientserver n...
163
click to vote
ISW
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We introduce the notion of persistent authenticated dictionaries, that is, dictionaries where the user can make queries of the type “was element e in set S at time t?...