Sciweavers

705 search results - page 98 / 141
» Approximating Extended Answer Sets
Sort
View
JELIA
2004
Springer
15 years 3 months ago
Hierarchical Decision Making by Autonomous Agents
Abstract. Often, decision making involves autonomous agents that are structured in a complex hierarchy, representing e.g. authority. Typically the agents share the same body of kno...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
ASP
2003
Springer
15 years 2 months ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
CP
2003
Springer
15 years 2 months ago
Terminating Decision Algorithms Optimally
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
Tuomas Sandholm
CONCUR
2001
Springer
15 years 2 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
EPIA
1999
Springer
15 years 2 months ago
YapOr: an Or-Parallel Prolog System Based on Environment Copying
YapOr is an or-parallel system that extends the Yap Prolog system to exploit implicit or-parallelism in Prolog programs. It is based on the environment copying model, as first imp...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...