Sciweavers

237 search results - page 7 / 48
» On the decidability and complexity of reasoning about only k...
Sort
View
KR
1998
Springer
13 years 11 months ago
Combining Narratives
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
John McCarthy, Tom Costello
ASM
2004
ASM
14 years 22 days ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy
IJCAI
1989
13 years 8 months ago
Reasoning about Kinematic Topology
t ion which is much more abstract than a place vocabulary, the kinematic topology. Kinematic topology does not define qualitative inference rules, but provides a characterization o...
Boi Faltings, Emmanuel Baechler, J. Primus
CSL
2004
Springer
14 years 22 days ago
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...
CHI
2009
ACM
13 years 10 months ago
I just don't know why it's gone: maintaining informal information use in inpatient care
We conducted a field-based study examining informal nursing information. We examined the use of this information before and after the adoption of a CPOE (Computerized Provider Ord...
Xiaomu Zhou, Mark S. Ackerman, Kai Zheng