Amanote Research

Amanote Research

    RegisterSign In

Proof Planning for First-Order Temporal Logic

Lecture Notes in Computer Science - Germany
doi 10.1007/11532231_17
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2005

Authors
Claudio CastelliniAlan Smaill
Publisher

Springer Berlin Heidelberg


Related search

A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Model Checking for a First-Order Temporal Logic Using Multiway Decision Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Temporal Logic Motion Planning for Mobile Robots

English

Literal Projection for First-Order Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

First-Order Dynamic Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1979English

A Denotational Semantics for First-Order Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

A Complete Axiomatization of a First-Order Temporal Logic Over Trace Systems

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1997English

Linear Temporal Logic-Based Mission Planning

International Journal of Interactive Multimedia and Artificial Intelligence
2016English

Geometrisation of First-Order Logic

Bulletin of Symbolic Logic
PhilosophyLogic
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy