✦ LIBER ✦

A rewriting approach to satisfiability procedures

✍ Scribed by Alessandro Armando; Silvio Ranise; Michaël Rusinowitch

Book ID: 114273345
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 285 KB
Volume: 183
Category: Article
ISSN: 0890-5401
DOI: 10.1016/s0890-5401(03)00020-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Boolean satisfiability approach to

✍ Andrei Horbach 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 403 KB

A rewriting logic approach to operationa

A rewriting logic approach to operational semantics

✍ Traian Florin Şerbănuţă; Grigore Roşu; José Meseguer 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 421 KB

A rewriting approach to binary decision

A rewriting approach to binary decision diagrams

✍ Hans Zantema; Jaco van de Pol 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 237 KB

A Semantic Approach to Order-sorted Rewr

A Semantic Approach to Order-sorted Rewriting

✍ A. Werner 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 863 KB

Order-sorted rewriting builds a nice framework to handle partially defined functions and subtypes. To be able to prove a critical-pair lemma and Birkhoff's completeness theorem, order-sorted rewriting was restricted to sort decreasing term rewriting systems. However, natural examples show that this

A finite state intersection approach to

A finite state intersection approach to propositional satisfiability

✍ José M. Castaño; Rodrigo Castaño 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 354 KB

A neural network approach to the 3-satis

A neural network approach to the 3-satisfiability problem

✍ James L. Johnson 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 251 KB