Sciweavers

138 search results - page 18 / 28
» Planning with Preferences Using Logic Programming
Sort
View
ICLP
2007
Springer
14 years 1 months ago
Multivalued Action Languages with Constraints in CLP(FD)
Abstract. Action description languages, such as A and B [6], are expressive instruments introduced for formalizing planning domains and problems. The paper starts by proposing a me...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
ARGMAS
2004
Springer
14 years 25 days ago
Negotiation Among DDeLP Agents
Negotiation can be conceived as the exchange of messages among self-interested agents in order to settle on an agreement over a given issue. They decide which messages to send acco...
Fernando A. Tohmé, Guillermo Ricardo Simari
ASP
2003
Springer
14 years 19 days ago
Implementing OCLP as a front-end for Answer Set Solvers: From Theory to Practice
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
Martin Brain, Marina De Vos
LOGCOM
1998
178views more  LOGCOM 1998»
13 years 7 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh
KR
1991
Springer
13 years 11 months ago
Meta-Reasoning in Executable Temporal Logic
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...
Howard Barringer, Michael Fisher, Dov M. Gabbay, A...