Sciweavers

417 search results - page 60 / 84
» Results on Reasoning about Updates in Transaction Logic
Sort
View
DALT
2005
Springer
15 years 6 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
JLP
2008
121views more  JLP 2008»
14 years 11 months ago
A process algebraic view of shared dataspace coordination
Coordination languages were introduced in the early 80's as programming notations to manage the interaction among concurrent collaborating software entities. Process algebras...
Nadia Busi, Gianluigi Zavattaro
PPDP
2007
Springer
15 years 6 months ago
Mechanized metatheory model-checking
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
James Cheney, Alberto Momigliano
87
Voted
ICLP
2005
Springer
15 years 6 months ago
A Type System for CHR
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...
Emmanuel Coquery, François Fages
97
Voted
AIIDE
2008
15 years 2 months ago
Recombinable Game Mechanics for Automated Design Support
Systems that provide automated game-design support-whether fully automated game generators, or tools to assist human designers--must be able to maintain a representation of a game...
Mark J. Nelson, Michael Mateas