Amanote Research

Amanote Research

    RegisterSign In

And-Or Tableaux for Fixpoint Logics With Converse: LTL, CTL, PDL and CPDL

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-08587-6_3
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2014

Authors
Rajeev Goré
Publisher

Springer International Publishing


Related search

C2PDLS: A Combination of Combinatory and Converse PDL With Substitutions

English

ExpTime Tableau Decision Procedures for Regular Grammar Logics With Converse

Studia Logica
Philosophy of ScienceLogicHistory
2011English

Completeness and Decidability of Converse PDL in the Constructive Type Theory of Coq

2018English

Monitor Circuits for LTL With Bounded and Unbounded Future

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Data Complexity of Query Answering in Expressive Description Logics via Tableaux

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2008English

Categories for Fixpoint-Semantics

1976English

Tableaux for Acceptance Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Fixpoint Semantics for Active Integrity Constraints

Artificial Intelligence
LinguisticsLanguageArtificial Intelligence
2018English

New Foundations for Fixpoint Computations

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy