Deimos: Query Answering Defeasible Logic System

Welcome

This page is the web interface to the Deimos query answering Defeasible logic system. The forms at the bottom of this page permit you to enter a Defeasible theory or try one of the sample theories. If you want to find out about Defeasible logic or Deimos, read on...

About Defeasible Logic

Defeasible logic is a knowledge representation method based on rules and priorities. There may be conflicts between rules in the sense that they support opposite conclusions A and not A. Priorities may help resolve such conflicts; if they fail then neither A nor not A are derived.

About Deimos

Deimos is an implementation of Defeasible logic in Haskell. It is a transparent implementation of Defeasible logic that permits rapid extension. The following documents (regularly updated) describe Deimos.

  • The Deimos Technical Report (short version) [.pdf]
  • The Deimos Technical Report (long version, with complete Haskell sources) [.pdf]
  • Deimos Syntax Help [.html]
  • Deimos Proof Help [.html]

Download the Deimos distribution here[.tar.gz].

Last updated: 2004-03-09 by Andrew Rock

Select an Example Defeasible Theory

Click on an example:

Create a New Defeasible Theory

Click here to create a new defeasible theory.