Pages that link to "Item:Q4819006"
From MaRDI portal
The following pages link to Defeasible logic programming: an argumentative approach (Q4819006):
Displayed 50 items.
- Argument graphs and assumption-based argumentation (Q253995) (← links)
- A quantitative approach to belief revision in structured probabilistic argumentation (Q287765) (← links)
- Preferences in artificial intelligence (Q314443) (← links)
- An approach to decision making based on dynamic argumentation systems (Q343918) (← links)
- Prioritized and non-prioritized multiple change on belief bases (Q421342) (← links)
- A general framework for sound assumption-based argumentation dialogues (Q460606) (← links)
- Postulates for logic-based argumentation systems (Q465599) (← links)
- Logic programming and burden of proof in legal reasoning (Q468586) (← links)
- Modeling time and valuation in structured argumentation frameworks (Q508777) (← links)
- A series of revisions of David Poole's specificity (Q524933) (← links)
- Belief revision in structured probabilistic argumentation, model and application to cyber security (Q524938) (← links)
- Defeasible reasoning + partial models: A formal framework for the methodology of research programs (Q538332) (← links)
- Instantiating abstract argumentation with classical logic arguments: postulates and properties (Q646494) (← links)
- Algorithms for generating arguments and counterarguments in propositional logic (Q648354) (← links)
- On the correspondence between abstract dialectical frameworks and nonmonotonic conditional logics (Q825004) (← links)
- A logic programming framework for possibilistic argumentation: Formalization and logical properties (Q835125) (← links)
- Semantic-based construction of arguments: an answer set programming approach (Q899190) (← links)
- An axiomatic analysis of structured argumentation with priorities (Q899441) (← links)
- On efficiently estimating the probability of extensions in abstract argumentation frameworks (Q899472) (← links)
- An approach to abstract argumentation with recursive attack and support (Q901084) (← links)
- A labeled argumentation framework (Q901086) (← links)
- The foundations of DeLP: Defeating relations, games and truth values (Q987489) (← links)
- An argument-based approach to reasoning with clinical knowledge (Q990964) (← links)
- On the evaluation of argumentation formalisms (Q1028909) (← links)
- Encoding deductive argumentation in quantified Boolean formulae (Q1045994) (← links)
- How does incoherence affect inconsistency-tolerant semantics for Datalog\(^\pm\)? (Q1653442) (← links)
- The first international competition on computational models of argumentation: results and analysis (Q1677447) (← links)
- Logic-based argumentation with existential rules (Q1678415) (← links)
- Fundamental properties of attack relations in structured argumentation with priorities (Q1693566) (← links)
- Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations (Q1711894) (← links)
- Designing context-aware systems: a method for understanding and analysing context in practice (Q1734516) (← links)
- A characterization of types of support between structured arguments and their relationship with support in abstract argumentation (Q1748533) (← links)
- A general semi-structured formalism for computational argumentation: definition, properties, and examples of application (Q1749391) (← links)
- Stratified belief bases revision with argumentative inference (Q1947030) (← links)
- A generalized proof-theoretic approach to logical argumentation based on hypersequents (Q2021565) (← links)
- Probabilistic argumentation: an approach based on conditional probability. A preliminary report (Q2055776) (← links)
- Evaluation of argument strength in attack graphs: foundations and semantics (Q2060740) (← links)
- Structured argumentation dynamics. Undermining attacks in default justification logic (Q2075383) (← links)
- An approach to improve argumentation-based epistemic planning with contextual preferences (Q2105569) (← links)
- Similarity measures based on compiled arguments (Q2145999) (← links)
- Argument strength in probabilistic argumentation using confirmation theory (Q2146004) (← links)
- Philosophical reflections on argument strength and gradual acceptability (Q2146010) (← links)
- Simple contrapositive assumption-based argumentation frameworks (Q2191233) (← links)
- Revealed preference in argumentation: algorithms and applications (Q2237149) (← links)
- Argumentative explanations for interactive recommendations (Q2238596) (← links)
- Computational complexity of flat and generic assumption-based argumentation, with and without probabilities (Q2238615) (← links)
- Incremental computation for structured argumentation over dynamic DeLP knowledge bases (Q2238730) (← links)
- t-DeLP: an argumentation-based temporal defeasible logic programming framework (Q2248517) (← links)
- Using argument strength for building dialectical bonsai (Q2248521) (← links)
- Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification (Q2270426) (← links)