CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

A First Order Extension of Stålmarck's Method

Magnus Björk (Institutionen för data- och informationsteknik, Datavetenskap (Chalmers))
Logic for Programming, Artificial Intelligence, and Reasoning, 2005, Montego Bay, Jamaica LNAI 3835, p. 276-291. (2005)
[Konferensbidrag, refereegranskat]

We describe an extension of Stålmarck's method in First Order Logic. Stålmarck's method is a tableaux-like theorem proving method for propositional logic, that uses a branch-and-merge rule known as the dilemma rule. This rule opens two branches and later merges them, by retaining their common consequences. The propositional version does this with normal set intersection, while the FOL version searches for pairwise unifiable formulae from the two branches. The proof procedure attempts to find proofs with as few simultaneously open branches as possible. We present the proof system and a proof procedure, and show soundness and completeness. We also present benchmarks for an implementation of the proof procedure.

Nyckelord: automated theorem proving, first order logic, stålmarck's method, tableaux

Denna post skapades 2006-08-25.
CPL Pubid: 9839


Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Datavetenskap (Chalmers)


Datavetenskap (datalogi)

Chalmers infrastruktur