Proof Complexity of Propositional Default Logic

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-14186-7_5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Proof Complexity of Propositional Default Logic

Archive for Mathematical Logic
PhilosophyLogic
2011English

The Complexity of Model Checking for Propositional Default Logics

Data and Knowledge Engineering
Information SystemsManagement
2005English

Expansion Nets: Proof-Nets for Propositional Classical Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

The Axiomatization of Propositional Logic

Formalized Mathematics
Computational MathematicsApplied Mathematics
2016English

Propositional Clausal Defeasible Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

A Propositional Logic of Temporal Connectives

Logic and Logical Philosophy
Philosophy
2014English

Uncontroversial Default Logic

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
2004English

Logical Closure Properties of Propositional Proof Systems

English

Encodings of Problems in Effectively Propositional Logic

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy