Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
8,646
Moments and Points in an Interval-Based Temporal Logic
- Contexts in context. In Contexts in Knowledge Representation and Natural Language, Proceedings of the 1997 AAAI Spring Symposium, Menlo Park, Calif
, 1989
"... The literature on the nature and representation of time is full of disputes and contradictory theories. This is surprising since the nature of time does not cause any worry for people in their everyday coping with the world. What this suggests is that there is some form of common sense knowledge abo ..."
Abstract
-
Cited by 82 (2 self)
- Add to MetaCart
relation MEET. We then show that this axiomatization subsumes Allen's interval-based theory. We then extend the theory by formally defining the beginnings and endings of intervals and show that these have properties we normally would associate with points. We distinguish between these point
Constraint deduction in an interval-based temporal logic
- Executable Modal and Temporal Logics, (Proc. of the IJCAI'93 Workshop), volume 897 of LNAI
, 1995
"... Abstract. We describe reasoning methods for the interval-based modal temporal logic LLP which employs the modal operators sometimes, always, next, and chop. We propose a constraint deduction approach and compare it with a sequent calculus, developed as the basic machinery for the deductive planning ..."
Abstract
-
Cited by 8 (2 self)
- Add to MetaCart
Abstract. We describe reasoning methods for the interval-based modal temporal logic LLP which employs the modal operators sometimes, always, next, and chop. We propose a constraint deduction approach and compare it with a sequent calculus, developed as the basic machinery for the deductive planning
Constraint Deduction in an Interval-based Temporal Logic
- In M. Fisher and R. Owens (Eds.), Executable Modal and Temporal Logics, Volume 897 of Lecture Notes in Arti Intelligence
, 1993
"... . We describe reasoning methods for the interval-based modal temporal logic LLP which employs the modal operators sometimes, always, next, and chop. We propose a constraint deduction approach and compare it with a sequent calculus, developed as the basic machinery for the deductive planning syste ..."
Abstract
- Add to MetaCart
. We describe reasoning methods for the interval-based modal temporal logic LLP which employs the modal operators sometimes, always, next, and chop. We propose a constraint deduction approach and compare it with a sequent calculus, developed as the basic machinery for the deductive planning
Managing Tasks Using an Interval-Based Temporal Logic
- Journal of Applied Intelligence
"... . We develop here a logic L t for reasoning about time. The main intended application is the task management of a medical decision support system. The language of the logic is propositional extended with interval concepts. A brief description is given of the implementation of L t in Prolog. The impl ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
. We develop here a logic L t for reasoning about time. The main intended application is the task management of a medical decision support system. The language of the logic is propositional extended with interval concepts. A brief description is given of the implementation of L t in Prolog
Maintaining knowledge about temporal intervals
- COMMUNICATION OF ACM
, 1983
"... The problem of representing temporal knowledge arises in many areas of computer science. In applications in which such knowledge is imprecise or relative, current representations based on date lines or time instants are inadequate. An interval-based temporal logic is introduced, together WiUl a comp ..."
Abstract
-
Cited by 2942 (13 self)
- Add to MetaCart
The problem of representing temporal knowledge arises in many areas of computer science. In applications in which such knowledge is imprecise or relative, current representations based on date lines or time instants are inadequate. An interval-based temporal logic is introduced, together WiUl a
On decidability and expressiveness of propositional interval neighborhood logics
- In Proceedings of the International Symposium on Logical Foundations of Computer Science (LFCS), volume 4514 of Lecture Notes in Computer Science
, 2007
"... Abstract. Interval-based temporal logics are an important research area in computer science and artificial intelligence. In this paper we investigate decidability and expressiveness issues for Propositional Neighborhood Logics (PNLs). We begin by comparing the expressiveness of the differ-ent PNLs. ..."
Abstract
-
Cited by 10 (7 self)
- Add to MetaCart
Abstract. Interval-based temporal logics are an important research area in computer science and artificial intelligence. In this paper we investigate decidability and expressiveness issues for Propositional Neighborhood Logics (PNLs). We begin by comparing the expressiveness of the differ-ent PNLs
Quality Checking of Medical Guidelines using Interval Temporal Logics
, 2007
"... Computer-based decision support in health-care is becoming increasingly important in recent years. Clinical Practise Guidelines (CPGs) are documents supporting health-care professionals in managing treatment of patients in order to avoid non-standard practices or outcomes. Following ideas from publ ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
publications of Hommersom, Lucas, and Balser, here we promote the use of temporal logics in order for formal specification and verification of CPGs. Unlike the works mentioned above, here we advocate the use of interval-based temporal logics instead of point-based ones. In particular, we discuss
Temporal and modal logic
- HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract
-
Cited by 1310 (17 self)
- Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
Alternating-time Temporal Logic
- Journal of the ACM
, 1997
"... Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract
-
Cited by 620 (53 self)
- Add to MetaCart
Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general
Results 1 - 10
of
8,646
