Sciweavers

565 search results - page 43 / 113
» Extending Answer Sets for Logic Programming Agents
Sort
View
LADS
2007
Springer
14 years 2 months ago
Facilitating Agent Development in Open Distributed Systems
One of the main reasons about the success of the Web is that many “regular users” are able to create Web pages that, using hyperlinks, incrementally extend both the size and th...
Mauro Gaspari, Davide Guidi
CORR
2002
Springer
106views Education» more  CORR 2002»
13 years 8 months ago
Domain-Dependent Knowledge in Answer Set Planning
In this paper we consider three di erent kinds of domain dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative ...
Tran Cao Son, Chitta Baral, Tran Hoai Nam, Sheila ...
ATVA
2006
Springer
160views Hardware» more  ATVA 2006»
13 years 11 months ago
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
Giorgio Delzanno, Javier Esparza, Jirí Srba
KRDB
1996
123views Database» more  KRDB 1996»
13 years 9 months ago
Flexible Query-Answering Systems Modelled in Metalogic Programming
Metaprogramming adds new expressive power to logic programming which can be advantageous to transfer to the field of deductive databases. We propose metaprogramming as a way to mo...
Troels Andreasen, Henning Christiansen
AAAI
2007
13 years 10 months ago
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
Diego Calvanese, Thomas Eiter, Magdalena Ortiz