Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming

Lecture Notes in Computer Science - Germany
doi 10.1007/11546207_13
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Argument-Based User Support Systems Using Defeasible Logic Programming

English

Forgetting for Defeasible Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Propositional Clausal Defeasible Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Towards a Possibilistic Logic

Fuzzy Set Theory and Advanced Mathematical Applications
1995English

Alienation and Dialectical Logic

Social Thought and Research
1972English

Characterising Deadlines in Temporal Modal Defeasible Logic

English

Dialectical Logic and Boolean Algebra

Journal of Mathematics Research
2019English

Computing Congruences Efficiently

Algebra Universalis
Number TheoryLogicAlgebra
2008English

An Asymmetric Protocol for Argumentation Games in Defeasible Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy