# DARR

DARR- a theorem prover for constrained and rational default logics. Default logics represent an important class of the nonmonotonic formalism. Using simple by powerful inference rules, called defaults, these logic systems model reasoning patterns of the form ”in the absence of information to the contrary of dots”, and thus formalize the default reasoning, a special type of nonmonotonic reasoning. In this paper we propose an automated system, called DARR, with two components: a propositional theorem prover and a theorem prover for constrained and rational propositional default logics. A modified version of semantic tableaux method is used to implement the propositional prover. Also, this theorem proving method is adapted for computing extensions because one of its purpose is to produce models, and extensions are models of the world described by default theories.

## References in zbMATH (referenced in 1 article , 1 standard article )

Showing result 1 of 1.

Sorted by year (