Sciweavers

81 search results - page 13 / 17
» A Basic Logic for Reasoning about Connector Reconfiguration
Sort
View
AAAI
2010
13 years 9 months ago
A General Game Description Language for Incomplete Information Games
A General Game Player is a system that can play previously unknown games given nothing but their rules. The Game Description Language (GDL) has been developed as a highlevel knowl...
Michael Thielscher
CCS
2005
ACM
14 years 1 months ago
A framework for concrete reputation-systems with applications to history-based access control
In a reputation-based trust-management system, agents maintain information about the past behaviour of other agents. This information is used to guide future trust-based decisions...
Karl Krukow, Mogens Nielsen, Vladimiro Sassone
CADE
2002
Springer
14 years 7 months ago
The Quest for Efficient Boolean Satisfiability Solvers
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
Lintao Zhang, Sharad Malik
FLAIRS
2007
13 years 9 months ago
Some Spatial and Spatio-Temporal Operators Derived from the Topological View of Knowledge
In this paper, we extend Moss and Parikh’s approach to reasoning about topological properties of knowledge. We turn that system in a spatio-temporal direction by successively ad...
Bernhard Heinemann
AGP
1994
IEEE
13 years 11 months ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari