Algorithms for Guiding Clausal Temporal Resolution

Gago, Marília; Fisher, Michael; Dixon, Clare

doi:10.1007/3-540-45751-8_16

Cited by 6 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, there is also a correspondence between our layer-by-layer saturation followed by the application of the Leap inference and the BFS-Loop search of CTR as described in [14,23]. Apart from being interesting in its own right, this view sheds new light on explaining BFS-Loop search, as it gives meaning to the intermediate clauses generated in the process, and we thus don't need to take the detour through the DNF representation of [6,7].…”

Section: Overviewmentioning

confidence: 79%

“…We implemented a simple prototype of both LPSup and CTR (with BFS loop-search in the style of [14]), in order to compare the two calculi on nontrivial examples. In this chapter we report on our experiment.…”

Section: Methodsmentioning

confidence: 99%

“…Even here, the idea of labels clearly separates logical content of the clauses from the meta-logical one (c.f. the ad hoc marker literal of [14]). …”

Section: Overviewmentioning

confidence: 99%

“…Here we focus on breadth first search for the loop as described in [14]. The idea is to perform the loop search by iteratively applying step resolution inferences to certain clauses and to organize the individual iterations by enriching the participating clauses with a special marking literal (see also [23]).…”

Section: Detailsmentioning

confidence: 99%

See 3 more Smart Citations

Labelled Superposition for PLTL

Suda

Weidenbach

2012

Logic for Programming, Artificial Intelligence, and Reasoning

View full text Add to dashboard Cite

Publication NotesThis report is an extended version of an article published elsewhere. AbstractThis paper introduces a new decision procedure for PLTL based on labelled superposition. Its main idea is to treat temporal formulas as infinite sets of purely propositional clauses over an extended signature. These infinite sets are then represented by finite sets of labelled propositional clauses. The new representation enables the replacement of the complex temporal resolution rule, suggested by existing resolution calculi for PLTL, by a fine grained repetition check of finitely saturated labelled clause sets followed by a simple inference. The completeness argument is based on the standard model building idea from superposition. It inherently justifies ordering restrictions, redundancy elimination and effective partial model building. The latter can be directly used to effectively generate counterexamples of non-valid PLTL conjectures out of saturated labelled clause sets in a straightforward way.

show abstract

Section: Overviewmentioning

confidence: 79%

Section: Methodsmentioning

confidence: 99%

“…Even here, the idea of labels clearly separates logical content of the clauses from the meta-logical one (c.f. the ad hoc marker literal of [14]). …”

Section: Overviewmentioning

confidence: 99%

Section: Detailsmentioning

confidence: 99%

See 2 more Smart Citations

Labelled Superposition for PLTL

Suda

Weidenbach

2012

Logic for Programming, Artificial Intelligence, and Reasoning

View full text Add to dashboard Cite

show abstract

“…A particular strength is in the development of clausal temporal resolution [20]. This has been shown to be relatively efficient and easy to mechanise [18]. The method is clausal which means temporal logic formulae must be translated into a normal form before resolution rules can be applied.…”

Section: Reasoning In Temporal Logicsmentioning

confidence: 99%

Time in Liverpool - an overview of temporal research in the logic and computation group

2005

12th International Symposium on Temporal Representation and Reasoning (TIME'05)

View full text Add to dashboard Cite

We provide an overview of the temporal research in the Logic and Computation Group at the University of Liverpool. While we cover both recent and current work, a more comprehensive document and list of references is available from the above web site or the web pages of individual group members.Members of the group have been instrumental in developing, and defining, research into reasoning and execution techniques for temporal logics and multi-modal and description logics. Since the application of logical techniques within complex systems has shown the need for effective ways for handling combinations of modal and temporal logics, work within the group has led to key results in this area and members of the group have contributed to leading publications in the field [3,42,27,21].

show abstract

Fair Derivations in Monodic Temporal Reasoning

Ludwig

Hustadt

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Algorithms for Guiding Clausal Temporal Resolution

Cited by 6 publications

References 14 publications

Labelled Superposition for PLTL

Labelled Superposition for PLTL

Time in Liverpool - an overview of temporal research in the logic and computation group

Fair Derivations in Monodic Temporal Reasoning

Contact Info

Product

Resources

About