Sciweavers

MATES
2009
Springer
14 years 6 months ago
Towards a Taxonomy of Decision Making Problems in Multi-Agent Systems
Abstract. Taxonomies in the area of Multi-Agent Systems (MAS) classify problems according to the underlying principles and assumptions of the agents’ abilities, rationality and i...
Christian Guttmann
MATES
2009
Springer
14 years 6 months ago
GOAL as a Planning Formalism
Abstract. It has been observed that there are interesting relations between planning and agent programming. This is not surprising as agent programming was partially motivated by t...
Koen V. Hindriks, Tijmen Roberti
MATES
2009
Springer
14 years 6 months ago
Concurrently Decomposable Constraint Systems
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
Cees Witteveen, Wiebe van der Hoek, Nico Roos
MATES
2009
Springer
14 years 6 months ago
Towards Pattern-Oriented Design of Agent-Based Simulation Models
Abstract. The formalization and use of experiences in good model design would make an important contribution to increasing the efficiency of modeling as well as to supporting the k...
Franziska Klügl, Lars Karlsson
LPNMR
2009
Springer
14 years 6 months ago
Complexity of the Stable Model Semantics for Queries on Incomplete Databases
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
Jos de Bruijn, Stijn Heymans
LPNMR
2009
Springer
14 years 6 months ago
Splitting a CR-Prolog Program
CR-Prolog is an extension of A-Prolog, the knowledge representation language at the core of the Answer Set Programming paradigm. CR-Prolog is
Marcello Balduccini
LPNMR
2009
Springer
14 years 6 months ago
Simple Random Logic Programs
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
Gayathri Namasivayam, Miroslaw Truszczynski
LPNMR
2009
Springer
14 years 6 months ago
Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programs
Modular nonmonotonic logic programs (MLPs) under the answer-set semantics have been recently introduced as an ASP formalism in which modules can receive context-dependent input fro...
Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas ...
LPNMR
2009
Springer
14 years 6 months ago
The Complexity of Circumscriptive Inference in Post's Lattice
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
Michael Thomas
LPNMR
2009
Springer
14 years 6 months ago
The Second Answer Set Programming Competition
Marc Denecker, Joost Vennekens, Stephen Bond, Mart...