- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j14 |      | Jeff Blee, David Billington, Guido Governatori, Abdul Sattar: Levels of modality for BDI Logic. J. Applied Logic 9(4): 250-273 (2011) |
| c26 | | David Billington: A Defeasible Logic for Clauses. Australasian Conference on Artificial Intelligence 2011: 472-480 |
| 2010 | ||
| j13 | | David Billington, Grigoris Antoniou, Guido Governatori, Michael J. Maher: An inclusion theorem for defeasible logics. ACM Trans. Comput. Log. 12(1): 6 (2010) |
| c25 |  | David Billington, Vladimir Estivill-Castro, René Hexel, Andrew Rock: Non-monotonic Reasoning for Requirements Engineering - State Diagrams Driven by Plausible Logic. ENASE 2010: 68-77 |
| c24 | | David Billington, Vladimir Estivill-Castro, René Hexel, Andrew Rock: Modelling Behaviour Requirements for Automatic Interpretation, Simulation and Deployment. SIMPAR 2010: 204-216 |
| 2009 | ||
| c23 | | David Billington, Vladimir Estivill-Castro, René Hexel, Andrew Rock: Architecture for Hybrid Robotic Behavior. HAIS 2009: 145-156 |
| 2008 | ||
| c22 | | Jeff Blee, David Billington, Guido Governatori, Abdul Sattar: Levels of Modalities for BDI Logic. Web Intelligence/IAT Workshops 2008: 647-650 |
| c21 | | |
| 2007 | ||
| c20 | | |
| c19 | | Jeff Blee, David Billington, Abdul Sattar: Reasoning with Levels of Modalities in BDI Logic. PRIMA 2007: 410-415 |
| 2006 | ||
| j12 | | Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher: Embedding defeasible logic into logic programming. TPLP 6(6): 703-735 (2006) |
| c18 | | David Billington, Vladimir Estivill-Castro, René Hexel, Andrew Rock: Using Temporal Consistency to Improve Robot Localisation. RoboCup 2006: 232-244 |
| 2005 | ||
| c17 | | David Billington: The Proof Algorithms of Plausible Logic Form a Hierarchy. Australian Conference on Artificial Intelligence 2005: 796-799 |
| c16 | | David Billington: A Fixed-Point Semantics for Plausible Logic. Australian Conference on Artificial Intelligence 2005: 812-815 |
| i3 | | Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher: Embedding Defeasible Logic into Logic Programming. CoRR abs/cs/0511055 (2005) |
| 2004 | ||
| j11 | | Guido Governatori, Michael J. Maher, Grigoris Antoniou, David Billington: Argumentation Semantics for Defeasible Logic. J. Log. Comput. 14(5): 675-702 (2004) |
| c15 | | |
| c14 | | Kewen Wang, David Billington, Jeff Blee, Grigoris Antoniou: Combining Description Logic and Defeasible Logic for the Semantic Web. RuleML 2004: 170-181 |
| 2003 | ||
| c13 | | David Billington, Andrew Rock: Constructive Plausible Logic Is Relatively Consistent. Australian Conference on Artificial Intelligence 2003: 954-965 |
| 2001 | ||
| j10 | | Michael J. Maher, Andrew Rock, Grigoris Antoniou, David Billington, Tristan Miller: Efficient Defeasible Reasoning Systems. International Journal on Artificial Intelligence Tools 10(4): 483-501 (2001) |
| j9 | | David Billington, Andrew Rock: Propositional Plausible Logic: Introduction and Implementation. Studia Logica 67(2): 243-269 (2001) |
| j8 | | Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher: Representation results for defeasible logic. ACM Trans. Comput. Log. 2(2): 255-287 (2001) |
| c12 | | Grigoris Antoniou, David Billington: Relating Defeasible and Default Logic. Australian Joint Conference on Artificial Intelligence 2001: 13-24 |
| 2000 | ||
| j7 | | Marilyn Ford, David Billington: Strategies in Human Nonmonotonic Reasoning. Computational Intelligence 16(3): 446-468 (2000) |
| j6 | | Grigoris Antoniou, Michael J. Maher, David Billington: Defeasible Logic versus Logic Programming without Negation as Failure. J. Log. Program. 42(1): 47-57 (2000) |
| c11 | | Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher: A Flexible Framework for Defeasible Logics. AAAI/IAAI 2000: 405-410 |
| c10 | | Andrew Rock, David Billington: An Implementation of Propositional Plausible Logic. ACSC 2000: 204-210 |
| c9 | | Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher, Andrew Rock: A Family of Defeasible Reasoning Logics and its Implementation. ECAI 2000: 459-463 |
| c8 | | Michael J. Maher, Andrew Rock, Grigoris Antoniou, David Billington, Tristan Miller: Efficient defeasible reasoning systems. ICTAI 2000: 384-392 |
| c7 | | Guido Governatori, Michael J. Maher, Grigoris Antoniou, David Billington: Argumentation Semantics for Defeasible Logics. PRICAI 2000: 27-37 |
| i2 | | Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher: A flexible framework for defeasible logics. CoRR cs.AI/0003013 (2000) |
| i1 | | Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher: Representation results for defeasible logic. CoRR cs.LO/0003082 (2000) |
| 1999 | ||
| j5 | | |
| c6 | | Grigoris Antoniou, David Billington, Michael J. Maher: On the Analysis of Regulations using Defeasible Rules. HICSS 1999 |
| c5 | | David Billington, Grigoris Antoniou, Guido Governatori, Michael J. Maher: Revising Nonmonotonic Theories: The Case of Defeasible Logic. KI 1999: 101-112 |
| c4 | | Grigoris Antoniou, Michael J. Maher, David Billington, Guido Governatori: A Comparison of Sceptical NAF-Free Logic Programming Approaches. LPNMR 1999: 347-356 |
| 1998 | ||
| c3 | | Michael J. Maher, Grigoris Antoniou, David Billington: A Study of Provability in Defeasible Logic. Australian Joint Conference on Artificial Intelligence 1998: 215-226 |
| c2 | | Grigoris Antoniou, David Billington, Michael J. Maher: Normal Forms for Defeasible Logic. IJCSLP 1998: 160-174 |
| 1997 | ||
| c1 | | David Billington: Proving Quantified Literals in Defeasible Logic. Australian Joint Conference on Artificial Intelligence 1997: 265-273 |
| 1996 | ||
| j4 | | David Billington, R. Geoff Dromey: The Co-invariant Generator: An Aid in Deriving Loop Bodies. Formal Asp. Comput. 8(1): 108-126 (1996) |
| 1993 | ||
| j3 | | |
| 1990 | ||
| j2 | | David Billington, Koen de Coster, Donald Nute: A modular translation from defeasible nets to defeasible logics. J. Exp. Theor. Artif. Intell. 2(2): 151-177 (1990) |
| 1982 | ||
| j1 | | David Billington: A simple proof that all 1-designs exist. Discrete Mathematics 42(2-3): 321-322 (1982) |
Colors in the list of coauthors
Last update Sat May 25 10:11:00 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page