191 search results - page 38 / 39 » A Reasoner for Simple Conceptual Logic Programs |
LPAR
2005
Springer
14 years 13 days ago
2005
Springer
Abstract. We distill Penrose’s argument against the “artificial intelligence premiss”, and analyze its logical alternatives. We then clarify the different positions one can...
AAMAS
2005
Springer
13 years 6 months ago
2005
Springer
One of the most difficult problems in Multi-Agent Systems (MAS) involves representing the knowledge and beliefs of an agent which performs its tasks in a dynamic environment. New p...
CADE
2009
Springer
14 years 7 months ago
2009
Springer
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
ESOP
2004
Springer
14 years 9 days ago
2004
Springer
We show how to combine trust management theories with nonce-based cryptographic protocols. The strand space framework for protocol analysis is extended by associating formulas from...
ICALP
1998
Springer
13 years 11 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...