Robert Cowen

According to our database1, Robert Cowen authored at least 19 papers between 1983 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
A Beginner's Guide to Mathematical Logic.
Am. Math. Mon., 2018

2015
Deleting Edges from Ramsey Minimal Examples.
Am. Math. Mon., 2015

2014
Adaptive Fault Diagnosis using Self-Referential Reasoning.
CoRR, 2014

2012
A Method for Constructing Minimally Unsatisfiable CNFs.
CoRR, 2012

2010
Generalized Davis-Putnam and satisfiability problems in mathematics.
Log. J. IGPL, 2010

2009
2-CNFS and Logical Embeddings.
Stud Logica, 2009

2008
Totally Greedy Coin Sets and Greedy Obstructions.
Electron. J. Comb., 2008

2007
Davis-Putnam Style Rules for Deciding Property S.
Fundam. Informaticae, 2007

Odd neighborhood transversals on grid graphs.
Discret. Math., 2007

2001
Property S.
Reports Math. Log., 2001

1998
A Compactness Theorem for Infinite Constraint Satisfaction.
Reports Math. Log., 1998

1996
A compactness theorem for linear equations.
Stud Logica, 1996

1993
Combinatorial Analytic Tableaux.
Reports Math. Log., 1993

BREAKUP: a preprocessing algorithm for satisfiability testing of CNF formulas.
Notre Dame J. Formal Log., 1993

Some Connections Between Set Theory and Computer Science.
Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

1991
Hypergraph Satisfiability.
Reports Math. Log., 1991

1990
Two Hypergraph Theorems Equivalent to BPI.
Notre Dame J. Formal Log., 1990

1986
Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency.
J. Graph Theory, 1986

1983
Compactness via prime semilattices.
Notre Dame J. Formal Log., 1983


  Loading...