Theorem Proving Modulo Based on Boolean Equational Procedures
Deduction with inference rules modulo computation rules plays an important role in automated deduction as an effective method for scaling up. We present four equational theories that are isomorphic to the traditional Boolean theory and show that each of them gives rise to a Boolean decision procedur...
Saved in:
| Institution: | Escuela Colombiana de Ingeniería |
|---|---|
| Main Authors: | , , |
| Format: | Documento de Conferencia |
| Language: | English |
| Published: |
Springer
2008
|
| Subjects: | |
| Online Access: | https://repositorio.escuelaing.edu.co/handle/001/1912 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
