Pages that link to "Item:Q4700098"
From MaRDI portal
The following pages link to Computing argumentation in logic programming (Q4700098):
Displaying 14 items.
- A general framework for sound assumption-based argumentation dialogues (Q460606) (← links)
- Algorithms for generating arguments and counterarguments in propositional logic (Q648354) (← links)
- Computing ideal sceptical argumentation (Q1028947) (← links)
- Encoding deductive argumentation in quantified Boolean formulae (Q1045994) (← links)
- Alternative foundations for Reiter's default logic (Q1589575) (← links)
- On argumentation logic and propositional logic (Q1743995) (← links)
- A general semi-structured formalism for computational argumentation: definition, properties, and examples of application (Q1749391) (← links)
- Relating defeasible and normal logic programming through transformation properties. (Q1853599) (← links)
- Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification (Q2270426) (← links)
- Dialectic proof procedures for assumption-based, admissible argumentation (Q2457643) (← links)
- DEFEASIBLE REASONING IN WEB-BASED FORMS THROUGH ARGUMENTATION (Q3528982) (← links)
- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach (Q5445306) (← links)
- An argument-based approach to reasoning with specificity (Q5958392) (← links)
- A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics (Q5958767) (← links)
