The Complexity of Model Checking for Propositional Default Logics

Data and Knowledge Engineering - Netherlands
doi 10.1016/j.datak.2005.03.002
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Proof Complexity of Propositional Default Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Complexity of Prioritized Default Logics

Journal of Artificial Intelligence Research
Artificial Intelligence
1998English

Proof Complexity of Propositional Default Logic

Archive for Mathematical Logic
PhilosophyLogic
2011English

Model Checking Logics for Communicating Sequential Agents

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Model-Checking Over Multi-Valued Logics

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Super-Łukasiewicz Propositional Logics

Nagoya Mathematical Journal
Mathematics
1981English

Extending Model Checking to Efficient Propositional Inference

International Journal of Machine Learning and Computing
ManagementComputer Science ApplicationsInformation SystemsArtificial Intelligence
2014English

Compact Propositional Godel Logics

English

Multi-Valued Modal Fixed Point Logics for Model Checking

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy