default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank M. Brown
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[c21]Frank M. Brown:
A comparison of autoepistemic logic and default logic both generalized so as to allow quantified variables to cross modal scopes. ISIC 2003: 831-836- [c20]Frank M. Brown:
Solving modal equivalences. ISIC 2003: 837-842 - [c19]Alison Alvarez, Stanislaw Bajcar, Frank M. Brown, Jerzy W. Grzymala-Busse, Zdzislaw S. Hippe:
Optimization of the ABCD Formula Used for Melanoma Diagnosis. IIS 2003: 233-240 - [c18]Frank M. Brown:
Decision Procedures for the Propositional Cases of Second Order Logic and Z Modal Logic Representations. TABLEAUX 2003: 237-245 - [c17]Frank M. Brown:
Logistica 2.0: A Technology for Implementing Automatic Deduction Systems. TABLEAUX 2003: 246-251
1990 – 1999
- 1992
- [c16]Wan-Bih Liaw, Frank M. Brown:
Knowledge Representing Schemes for Planning. ACM Conference on Computer Science 1992: 213-218 - 1991
- [c15]Salvinder S. Hundal, Frank M. Brown:
A theory of nonmonotonic planning. ACM Conference on Computer Science 1991: 247-254 - 1990
- [b2]Frank M. Brown:
Boolean reasoning - the logic of boolean equations. Kluwer 1990, ISBN 978-0-7923-9121-0, pp. I-XVIII, 1-273 - [c14]Wah-Bih Liaw, Frank M. Brown, Seung S. Park:
Towards Common Sense Planning. ACM Conference on Computer Science 1990: 281-287 - [c13]Frank M. Brown, Carlos Araya:
Schemata. CADE 1990: 643-644 - [c12]Frank M. Brown, Carlos Araya:
Cylindric Algebra Equation Solver. CADE 1990: 645-646 - [c11]Carlos Araya, Frank M. Brown:
SCHEMATA: A Language for Deduction. ECAI 1990: 38-40
1980 – 1989
- 1988
- [c10]Frank M. Brown, Seung S. Park:
SYMEVAL: A Theorem Prover Based on the Experimental Logic. CADE 1988: 756-757 - [c9]Frank M. Brown, Seung S. Park, Jim Phelps:
ZPLAN: An Automatic Reasoning System for Situations. CADE 1988: 758-759 - 1986
- [j17]Frank M. Brown:
An Experimental Logic Based on the Fundamental Deduction Principle. Artif. Intell. 30(2): 117-263 (1986) - [c8]Frank M. Brown:
A Commonsense Theory of Nonmonotonic Reasoning. CADE 1986: 209-228 - 1985
- [c7]Frank M. Brown, Peiya Liu:
A Logic Programming and Verification System for Recursive Quantificational Logic. IJCAI 1985: 742-748 - 1984
- [j16]Frank M. Brown, Yoshihide Igarashi:
On permutations of wires and states. Discret. Appl. Math. 7(3): 231-241 (1984) - 1981
- [j15]Frank M. Brown:
Design of a MUMPS Interpreter. Softw. Pract. Exp. 11(12): 1293-1297 (1981) - 1980
- [j14]Frank M. Brown:
An Investigation Into the Goals of Research in Automatic Theorem Proving as Related to Mathematical Reasoning. Artif. Intell. 14(3): 221-242 (1980)
1970 – 1979
- 1979
- [j13]Frank M. Brown, Sten-Åke Tärnlund:
Inductive Reasoning on Recursive Equations. Artif. Intell. 12(3): 207-229 (1979) - 1978
- [b1]Frank M. Brown:
Towards the automation of mathematical reasoning. University of Edinburgh, UK, 1978 - [j12]Frank M. Brown:
Towards the Automation of Set Theory and its Logic. Artif. Intell. 10(3): 281-316 (1978) - [c6]Frank M. Brown:
A Sequent Calculus for Modal Quantificational Logic. AISB/GI (ECAI) 1978: 56-65 - [c5]Frank M. Brown, Camilla Schwind:
Analysing and Representing Natural Language in Logic. AISB/GI (ECAI) 1978: 66-70 - 1977
- [c4]Frank M. Brown:
A Theorem Prover for Elementary Set Theory. IJCAI 1977: 534-540 - [c3]Frank M. Brown, Sten-Åke Tärnlund:
Inductive Reasoning in Mathematics. IJCAI 1977: 844-850 - 1976
- [c2]Frank M. Brown:
The Role of Extensible Deductive Systems in Mathematical Reasoning. AISB (ECAI) 1976: 74-83 - [c1]Frank M. Brown:
A Deductive System for elementary Arithmetic. AISB (ECAI) 1976: 84-93 - 1975
- [j11]Frank M. Brown:
The Constrained-Input Problem. IEEE Trans. Computers 24(1): 102-106 (1975) - [j10]Frank M. Brown:
Equational Realizations of Switching Functions. IEEE Trans. Computers 24(11): 1054-1066 (1975) - [j9]Frank M. Brown:
Weighted Realizations of Switching Functions. IEEE Trans. Computers 24(12): 1217-1221 (1975) - 1974
- [j8]Frank M. Brown:
Equational Logic. IEEE Trans. Computers 23(12): 1228-1237 (1974) - 1971
- [j7]Frank M. Brown:
Single-Parameter Solutions for Flip-Flop Equations. IEEE Trans. Computers 20(4): 452-454 (1971) - 1970
- [j6]Frank M. Brown:
Comment on "The Determination of the Maximum Compatibility Classes". IEEE Trans. Computers 19(5): 459 (1970) - [j5]Frank M. Brown:
Reduced Solutions of Boolean Equations. IEEE Trans. Computers 19(10): 976-981 (1970)
1960 – 1969
- 1969
- [j4]Frank M. Brown:
Comment on "Canonical Programming of Nonlinear and Time-Varying Differential Equations". IEEE Trans. Computers 18(6): 566 (1969) - 1968
- [j3]Frank M. Brown:
The Origin of the Method of Iterated Consensus. IEEE Trans. Computers 17(8): 802 (1968) - 1965
- [j2]Frank M. Brown:
Code Transformation in Sequential Machines. IEEE Trans. Electron. Comput. 14(6): 822-829 (1965) - 1963
- [j1]Frank M. Brown:
A Node-Elimination Theorem for Boolean Matrices. IEEE Trans. Electron. Comput. 12(2): 133-134 (1963)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-06 00:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
