The following pages link to (Q3184604):
Displayed 12 items.
- A Propositional CONEstrip Algorithm (Q5227400) (← links)
- A Panorama of Iterated Revision (Q5250306) (← links)
- Implementing Efficient All Solutions SAT Solvers (Q5266602) (← links)
- Logics for extended distributive contact lattices (Q5375878) (← links)
- Guest editors' introduction (Q5919727) (← links)
- Machine learning and logic: a new frontier in artificial intelligence (Q6056641) (← links)
- Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs (Q6063883) (← links)
- Belief revision and computational argumentation: a critical comparison (Q6097772) (← links)
- ASP and subset minimality: enumeration, cautious reasoning and MUSes (Q6103676) (← links)
- SAT backdoors: depth beats size (Q6152185) (← links)
- An Epistemological Study of Theory Change (Q6162076) (← links)
- Recognizing textual entailment and computational semantics (Q6201606) (← links)