• Publications
• Influence
Boolean reasoning - the logic of boolean equations
• F. Brown
• Mathematics, Computer Science
• 1990
1 Fundamental Concepts.- 1.1 Formulas.- 1.2 Propositions and Predicates.- 1.3 Sets.- 1.4 Operations on Sets.- 1.5 Partitions.- 1.6 Relations.- 1.7 Functions.- 1.8 Operations and Algebraic Systems.- 2Expand
• 264
• 41
• PDF
Towards the Automation of Set Theory and its Logic
• F. Brown
• Computer Science
• Artif. Intell.
• 1 November 1978
We give a prototype extensible deductive system for elementary set theory which is based on truth-value preserving transformations, and then describe an experimental application of it to the first few chapters of W. O. Quine's book: Set Theory and its Logic. Expand
• 39
• 3
Reduced Solutions of Boolean Equations
• F. Brown
• Mathematics, Computer Science
• IEEE Transactions on Computers
• 1 October 1970
This paper describes a method for constructing reduced solutions, i.e., general solutions involving the fewest parameters possible, for Boolean equations. Expand
• 19
• 3
The modal quantificational logic Z applied to the frame problem
A blade type cleaning device for use with an electrophotographic copying machine of the image transfer type includes a cleaning blade having an end edge urged into contact with the surface of a photosensitive drum to clean such surface. Expand
• 10
• 1
ACTION, REFLECTIVE POSSIBILITY, AND THE FRAME PROBLEM
• Mathematics
• 1987
A solution to the frame problem is proposed. This solution is based on the idea that the frame problem can essentially be reduced to the concepts of reflection and logical possibility. Both a veryExpand
• 5
• 1
The Constrained-Input Problem
• F. Brown
• Mathematics, Computer Science
• IEEE Transactions on Computers
• 1975
Given a combinational output function f and an input constraint φ = 0, there is a set G( f, φ) of output functions equivalent to f with respect to φ. Expand
• 4
• 1
Single-Parameter Solutions for Flip-Flop Equations
• F. Brown
• Computer Science
• IEEE Transactions on Computers
• 1 April 1971
General one-parameter solutions are exhibited for the RS, RST, and JK flip-flop input equations. Expand
• 3
• 1
A Theorem Prover for Elementary Set Theory
• F. Brown
• Mathematics, Computer Science
• IJCAI
• 22 August 1977
We describe a theorem prover for elementary set theory which is based on truth value preserving transformations, and then give an example of the protocol produced by this system when trying to prove the theorem of set theory known as Cantor's Theorem. Expand
• 4
• PDF
Inductive Reasoning in Mathematics
• Mathematics, Computer Science
• IJCAI
• 22 August 1977
We investigate several methods of inductive reasoning in the domain of difference equations, including the method of generalization with beliefs, and temporal methods based on comparisons with previously solved problems. Expand
• 4
• PDF