Amanote Research

Amanote Research

    RegisterSign In

Propositional Clausal Defeasible Logic

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-87803-2_5
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

Unknown

Authors
David Billington
Publisher

Springer Berlin Heidelberg


Related search

Forgetting for Defeasible Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

A Satisfiability Tester for Non-Clausal Propositional Calculus

English

Inductive Equivalence in Clausal Logic and Nonmonotonic Logic Programming

Machine Learning
Artificial IntelligenceSoftware
2010English

The Axiomatization of Propositional Logic

Formalized Mathematics
Computational MathematicsApplied Mathematics
2016English

Characterising Deadlines in Temporal Modal Defeasible Logic

English

A Propositional Logic of Temporal Connectives

Logic and Logical Philosophy
Philosophy
2014English

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

Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy