LOGCOM
2002
13 years 7 months ago
2002
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
LOGCOM
2002
13 years 7 months ago
2002
In the area of agent-based computing there are many proposals for specific system architectures, and a number of proposals for general approaches to building agents. As yet, howev...
LOGCOM
2002
13 years 7 months ago
2002
We give a categorial characterization of how labelled deduction systems for logics with a propositional basis behave under unconstrained fibring and under fibring that is constrai...
LOGCOM
2002
13 years 7 months ago
2002
paper, we present an abstract formal model of decision-making in a social setting that covers all aspects of the process, from recognition of a potential for cooperation through t...
LOGCOM
2002
13 years 7 months ago
2002
LOGCOM
2002
13 years 7 months ago
2002
LOGCOM
2002
13 years 7 months ago
2002
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
LOGCOM
2002
13 years 7 months ago
2002
One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if...
LOGCOM
2002
13 years 7 months ago
2002
The paper deals with logically definable families of sets (or point-sets) of rational numbers. In particular we are interested whether the families definable over the real line wi...
LOGCOM
2002
13 years 7 months ago
2002
