The proof algorithms of Plausible Logic form a hierarchy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3809 LNAI, Issue , 2005, Pages 796-799

  Billington, David ^a  

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; HIERARCHICAL SYSTEMS; LOGIC PROGRAMMING;

AMBIGUITY BLOCKING; PLAUSIBLE LOGICS;

FORMAL LOGIC;

EID: 33745606742     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11589990_83     Document Type: Conference Paper

References (4)

1. David Billington. A Plausible Logic which Detects Loops. In Proceedings of the Tenth International Workshop on Nonmonotonic Reasoning, pages 65-71, Whistler BC Canada, June 2004.
2. David Billington and Andrew Rock. Prepositional Plausible Logic: Introduction and Implementation. Studio Logica 67:243-269, 2001.
3. D. Billington, A. Rock. Constructive Plausible Logic is Relatively Consistent. Proceedings of the 16th Australian Conference on Artificial Intelligence, 2003, Lecture Notes in Artificial Intelligence vol. 2903,954-965. Springer 2003.
4. Guido Govematori, Michael J. Maher, Grigoris Antoniou, and David Billington. Argumentation Semantics for Defeasible Logic. Journal of Logic and Computation, 14(5) (2004), 675-702. Oxford University Press 2004.