Sciweavers

408 search results - page 18 / 82
» Relation Algebras for Reasoning about Time and Space
Sort
View
KR
1991
Springer
13 years 11 months ago
Meta-Reasoning in Executable Temporal Logic
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...
Howard Barringer, Michael Fisher, Dov M. Gabbay, A...
ESAW
2006
Springer
13 years 11 months ago
Using Constraints and Process Algebra for Specification of First-Class Agent Interaction Protocols
Abstract. Current approaches to multi-agent interaction involve specifying protocols as sets of possible interactions, and hard-coding decision mechanisms into agent programs in or...
Tim Miller, Peter McBurney
LICS
1990
IEEE
13 years 11 months ago
Extensional PERs
In the paper "Extensional PERs" by P. Freyd, P. Mulry, G. Rosolini and D. Scott, a category C of "pointed complete extensional PERs" and computable maps is int...
Peter J. Freyd, P. Mulry, Giuseppe Rosolini, Dana ...
CADE
2007
Springer
14 years 8 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
AAMAS
2007
Springer
13 years 7 months ago
An algebra for commitment protocols
Protocols enable unambiguous, smooth interactions among agents. Commitments among agents are a powerful means of developing protocols. Commitments enable flexible execution of pro...
Ashok U. Mallya, Munindar P. Singh