Complexity of Prioritized Default Logics

Journal of Artificial Intelligence Research - United States
doi 10.1613/jair.554
Full Text
Abstract

Available in full text

Date
Authors
Publisher

AI Access Foundation

Related search

The Complexity of Model Checking for Propositional Default Logics

Data and Knowledge Engineering
Information SystemsManagement
2005English

Proof Complexity of Propositional Default Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Proof Complexity of Propositional Default Logic

Archive for Mathematical Logic
PhilosophyLogic
2011English

Real-Time Logics: Complexity and Expressiveness

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

The Complexity of Lattice-Based Fuzzy Description Logics

Journal on Data Semantics
Computer NetworksInformation SystemsArtificial IntelligenceCommunications
2012English

The Complexity of Reasoning With Boolean Modal Logics

2002English

Data Complexity of Query Answering in Expressive Description Logics via Tableaux

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2008English

On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Lossless Prioritized Embeddings

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy