A proof procedure for temporal logic programming

dc.contributor.authorGergatsoulis, M.en
dc.contributor.authorNomikos, C.en
dc.date.accessioned2015-11-24T17:00:39Z
dc.date.available2015-11-24T17:00:39Z
dc.identifier.issn0129-0541-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10798
dc.rightsDefault Licence-
dc.subjecttemporal logic programmingen
dc.subjectproof proceduresen
dc.subjectbranching-timeen
dc.subjecttheorem provingen
dc.subjecttransformation techniqueen
dc.subjecttimeen
dc.subjectlanguageen
dc.titleA proof procedure for temporal logic programmingen
heal.abstractIn this paper, we propose a new resolution proof procedure for the branching-time logic programming language Cactus. The particular strength of the new proof procedure, called CSLD-resolution, is that it can handle, in a more general way, open-ended queries, i.e. goal clauses that include atoms which do not refer to specific moments in time, without the need of enumerating all their canonical instances. We also prove soundness, completeness and independence of the computation rule for CSLD-resolution. The new proof procedure overcomes the limitations of a family of proof procedures for temporal logic programming languages, which were based on the notions of canonical program and goal clauses. Moreover, it applies directly to Chronolog programs and it can be easily extended to apply to multi-dimensional logic programs as well as to Chronolog(MC) programs.en
heal.accesscampus-
heal.fullTextAvailabilityTRUE-
heal.journalNameInternational Journal of Foundations of Computer Scienceen
heal.journalTypepeer reviewed-
heal.languageen-
heal.publicationDate2004-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.typejournalArticle-
heal.type.elΆρθρο Περιοδικούel
heal.type.enJournal articleen

Αρχεία

Φάκελος/Πακέτο αδειών

Προβολή: 1 - 1 of 1
Φόρτωση...
Μικρογραφία εικόνας
Ονομα:
license.txt
Μέγεθος:
1.74 KB
Μορφότυπο:
Item-specific license agreed upon to submission
Περιγραφή: