✦ LIBER ✦

Automated theorem proving in temporal logic: T-resolution

✍ Scribed by Zhaokeng Zhao; Jun Dai; Wendan Chen

Book ID: 112945645
Publisher: Springer
Year: 1994
Tongue: English
Weight: 535 KB
Volume: 9
Category: Article
ISSN: 1000-9000
DOI: 10.1007/bf02939486

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Automated theorem proving by resolution

Automated theorem proving by resolution in non-classical logics

✍ Viorica Sofronie-Stokkermans 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 600 KB

Interactive Theorem Proving with Tempora

Interactive Theorem Proving with Temporal Logic

✍ Amy Felty; Laurent Théry 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 721 KB

In this paper, we present a theorem prover for linear temporal logic. Our goal is to extend the capabilities of existing interactive and automatic systems for verifying temporal properties of software and hardware systems. We focus on increasing the effectiveness of user interaction in such systems.

Automated theorem proving for non-classi

Automated theorem proving for non-classical logics

📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 14 KB

Automated theorem proving for Łukasiewic

Automated theorem proving for Łukasiewicz logics

✍ Gordon Beavers 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 650 KB

First-Order Logic and Automated Theorem

First-Order Logic and Automated Theorem Proving, M. Fitting, Springer, 1990, 242 pp.

✍ G.-C. Rota 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 41 KB

Limited resource strategy in resolution

Limited resource strategy in resolution theorem proving

✍ Alexandre Riazanov; Andrei Voronkov 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 245 KB

For most applications of first-order theorem provers a proof should be found within a fixed time limit. When the time limit is set, systems can perform much better by using algorithms other than the ordinary complete ones. In this paper we describe the limited resource strategy (LRS) intended to imp