A Rewriting Decision Procedure for Dijkstra-Scholten's Syllogistic Logic with Complements

Rocha, Camilo; Meseguer, José

Permalink

https://hdl.handle.net/2142/11411 Copy

Description

Title

A Rewriting Decision Procedure for Dijkstra-Scholten's Syllogistic Logic with Complements

Author(s)

• Rocha, Camilo
• Meseguer, José

Issue Date

2007-12

Keyword(s)

computer science

Abstract

We present an equational decision procedure a la Dijkstra & Scholten for the `Syllogistic Logic with Complements'. First, we give an equational axiomatization of Dijkstra & Scholten's propositional logic and show how it gives a decision procedure for propositional logic by equational term rewriting. We also show how one can efficiently obtain certain propositional models (i.e., truth assignments over propositional variables) from the canonical forms given by the system. We then present the Syllogistic Logic with Complements and show how the decision procedure for propositional logic can be easily extended to obtain a decision procedure for this subset of First-Order Logic. Moreover, an executable specification of both decision procedures is presented in the Maude system, and examples illustrating the use of both canonical equational systems are given.

Type of Resource

text

Permalink

http://hdl.handle.net/2142/11411

Copyright and License Information

You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).

Owning Collections