SAT in Monadic Gödel Logics: A Borderline Between Decidability and Undecidability

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-02261-6_10
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Monadic Fragments of Gödel Logics: Decidability and Undecidability Results

English

Decidability and Undecidability of Marked PCP

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Towards a Proof Theory of Gödel Modal Logics

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Fuzzy Description Logics Under Gödel Semantics

International Journal of Approximate Reasoning
Applied MathematicsTheoretical Computer ScienceArtificial IntelligenceSoftware
2009English

On Decidability of Monadic Logic of Order Over the Naturals Extended by Monadic Predicates

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2007English

A Finite Model Property for Gödel Modal Logics

English

Undecidability of Modal and Intermediate First-Order Logics With Two Individual Variables

Journal of Symbolic Logic
PhilosophyLogic
1993English

Axiom Pinpointing in Lightweight Description Logics via Horn-Sat Encoding and Conflict Analysis

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Undecidability in the Act . . .

The Undecidable Unconscious: A Journal of Deconstruction and Psychoanalysis
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy