Search strategies for resolution in temporal logics
type: Item
instance of: scholarly article
title: Search strategies for resolution in temporal logics
zbMATH Open document ID: 1412.68218
DOI: 10.1007/3-540-61511-3_121
author: Clare Dixon
published in: Automated Deduction — Cade-13
publication date: 2019-01-15T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 03B44
zbMATH DE Number: 7001945
zbMATH Keywords: temporal resolution
zbMATH Keywords: temporal logic
zbMATH Keywords: linear temporal logic
zbMATH Keywords: disjunctive normal form
zbMATH Keywords: start node
MaRDI profile type: MaRDI publication profile
full work available at URL: 3-540-61511-3 121
OpenAlex ID: W1537740740
cites work: Nonclausal deduction in first-order temporal logic
cites work: Q3338212
cites work: Q4518437
cites work: Q4012170
cites work: Q4264717
cites work: Verifying concurrent processes using temporal logic
cites work: Specifying Concurrent Program Modules
cites work: Q4002642
cites work: Myths about the mutual exclusion problem
cites work: Q3700812
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: The complexity of propositional linear temporal logics
cites work: Q3741614
cites work: Q3710510
Recommended article: Q4012170
Recommended article: On Solving Temporal Logic Queries
Recommended article: Q3741614
Recommended article: Resolution for temporal logics of knowledge
Recommended article: Resolution-based calculi for modal and temporal logics
Recommended article: Temporal Constraint Satisfaction Problems in Fixed-Point Logic
Recommended article: Finding State Solutions to Temporal Logic Queries
Recommended article: More efficient proof-search for sequents of temporal logic
Recommended article: Modelling and solving temporal reasoning as propositional satisfiability
Recommended article: Automated theorem proving in temporal logic: \(T\)-resolution
description: scientific article; zbMATH DE number 7001945