Sciweavers

787 search results - page 69 / 158
» Polynomial Constants are Decidable
Sort
View
MATES
2005
Springer
14 years 1 months ago
A Goal Deliberation Strategy for BDI Agent Systems
One aspect of rational behavior is that agents can pursue multiple goals in parallel. Current BDI theory and systems do not provide a theoretical or architectural framework for dec...
Alexander Pokahr, Lars Braubach, Winfried Lamersdo...
LATIN
2004
Springer
14 years 1 months ago
A Proof System and a Decision Procedure for Equality Logic
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
Olga Tveretina, Hans Zantema
CORR
2008
Springer
89views Education» more  CORR 2008»
13 years 8 months ago
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand...
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 8 months ago
Observable Graphs
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
Raphael M. Jungers, Vincent D. Blondel
FUIN
2000
115views more  FUIN 2000»
13 years 8 months ago
Constructing the Least Models for Positive Modal Logic Programs
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
Linh Anh Nguyen