14th International Symposium on Temporal Representation and Reasoning (TIME'07) 2007
DOI: 10.1109/time.2007.41
|View full text |Cite
|
Sign up to set email alerts
|

Automated Natural Deduction for Propositional Linear-Time Temporal Logic

Abstract: We present a proof searching technique for the natural deduction calculus for the propositional linear-time temporal logic and prove its correctness. This opens the prospect to apply our technique as an automated reasoning tool in a number of emerging computer science applications and in a deliberative decision making framework across various AI applications.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
22
0

Year Published

2008
2008
2021
2021

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(22 citation statements)
references
References 12 publications
0
22
0
Order By: Relevance
“…, where V(A) is the set of variables V i and of label terms headed by a Skolem function occurring in A; 4 At this point, labels whose head is a Skolem function symbol are treated as if they were simply variables.…”
Section: Completenessmentioning
confidence: 99%
See 2 more Smart Citations
“…, where V(A) is the set of variables V i and of label terms headed by a Skolem function occurring in A; 4 At this point, labels whose head is a Skolem function symbol are treated as if they were simply variables.…”
Section: Completenessmentioning
confidence: 99%
“…However, it is interesting to note that our system for local reasoning seems to be closely related to the natural deduction system for future-time LTL of [4], which was developed in parallel with our work. We have begun investigating whether similar rules would also be suited for the extension to global reasoning in both past-time and future-time DTL and plan to report on this soon.…”
Section: Related and Future Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Rules for the logical connectives and the temporal operators. We illustrate the use of the tableaux system with an ex- 2 Note that the trichotomy rule may lead to considerable branching in the tableaux. In [1], we have replaced this rule by a set of rules that permit only controlled forms of trichotomy.…”
Section: Tableaux For Local Reasoningmentioning
confidence: 99%
“…We have designed our systems with the aim of providing tableaux for full DTL, including past, but it is interesting to note that our system for local reasoning seems to be closely related to the natural deduction system for futuretime LTL of [2], which was developed in parallel with our work. We have begun investigating whether the rules of [2] would also be suited for the extension to global reasoning in past and future-time DTL, and plan to report on this soon.…”
Section: Related and Future Workmentioning
confidence: 99%