4617 search results - page 248 / 924 » Automation of Diagrammatic Reasoning |
161
click to vote
ICLP
1999
Springer
15 years 10 months ago
1999
Springer
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available...
141
click to vote
TIME
1998
IEEE
15 years 10 months ago
1998
IEEE
Kowalski and Sergot's Event Calculus (EC) is a simAppeared in the Proceedings of the Fifth International Workshop on Temporal Representation and Reasoning -- TIME'98 (R....
155
click to vote
ALP
1994
Springer
15 years 10 months ago
1994
Springer
This paper introduces a logic for a class of properties - in particular variable aliasing - used in static analysis of logic programs. The logic is shown to be sound, complete and ...
161
click to vote
KR
2000
Springer
15 years 10 months ago
2000
Springer
Acquiring information about its environment by sensing is a crucial ability of autonomous robots. Based on the established solution to the Frame Problem of the Fluent Calculus, we...
168
click to vote
DLOG
2007
15 years 8 months ago
2007
Possibilistic logic provides a convenient tool for dealing with inconsistency and handling uncertainty. In this paper, we propose possibilistic description logics (DLs) as an exten...