A constant time algorithm for theorem proving in propositional logic on reconfigurable meshes

In this paper, we present an O(1) time algorithm for theorem proving in propositional logic on processor arrays with a reconfigurable bus system of size m × 2 n , where m is the number of clauses and n is the number of Boolean variables. The theorem proving problem involves combinatorial exploration...

Full description

Saved in:

Bibliographic Details
Published in:	Information sciences Vol. 85; no. 1; pp. 175 - 184
Main Authors:	Pradeep, B., Siva Ram Murthy, C.
Format:	Journal Article
Language:	English
Published:	New York, NY Elsevier Inc 01.07.1995 Elsevier Science
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Artificial intelligence Computer science; control theory; systems Exact sciences and technology Learning and adaptive systems Programming theory Theoretical computing Propositional logic Parallel algorithm Array processor Theorem proving Combinatorial problem Logic array Time complexity Inference rule Reconfiguration Bus system
ISSN:	0020-0255, 1872-6291
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!