The following pages link to Yannis Dimopoulos (Q242596):
Displaying 18 items.
- Graph theoretical structures in logic programs and default theories (Q672050) (← links)
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners (Q835826) (← links)
- A graph-theoretic approach to default logic (Q1333271) (← links)
- On kernels, defaults and even graphs (Q1370591) (← links)
- On the computational complexity of assumption-based argumentation for default reasoning. (Q1852857) (← links)
- Encoding reversing Petri nets in answer set programming (Q2039911) (← links)
- plasp 3: towards effective ASP planning (Q2401946) (← links)
- Extending SATPLAN to Multiple Agents (Q3076944) (← links)
- Propagation in CSP and SAT (Q3524239) (← links)
- Argumentation Based Modelling of Embedded Agent Dialogues (Q3623910) (← links)
- Extending Argumentation to Make Good Decisions (Q3645317) (← links)
- On the semantics of inheritance networks (Q3993670) (← links)
- (Q4537429) (← links)
- (Q4812972) (← links)
- plasp 3: Towards Effective ASP Planning (Q4957186) (← links)
- A General Framework for Argumentation-Based Negotiation (Q5385610) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5424864) (← links)
- On computing logic programs (Q5961490) (← links)