Man-machine theorem proving in graph theory
DOI10.1016/0004-3702(88)90030-6zbMATH Open0646.68107OpenAlexW1965876066MaRDI QIDQ1104124FDOQ1104124
Authors: Irena Pevac, Dragoš Cvetković 
Publication date: 1988
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(88)90030-6
Recommendations
- scientific article; zbMATH DE number 3906548
- scientific article; zbMATH DE number 4047184
- scientific article; zbMATH DE number 4101136
- scientific article; zbMATH DE number 3845636
- Computer theorem proving in mathematics
- Deduction graphs: an algorithm and applications
- scientific article; zbMATH DE number 1748578
- Computability of graphs
- scientific article; zbMATH DE number 4128857
interactive programmingcomplexity measurecomputerized graph theory bibliographygraph theoretic algorithmsmechanical theorem prover
Graph theory (including graph drawing) in computer science (68R10) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-resolution theorem proving
- Title not available (Why is that?)
- Graph equations for line graphs and total graphs
- Theorem proving with abstraction
- A man-machine theorem-proving system
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Splitting and reduction heuristics in automatic theorem proving
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (19)
- Operational research models in action, the result of international cooperation -- a potpourri
- Computers and discovery in algebraic graph theory
- Title not available (Why is that?)
- A knowledge-based system for graph theory demonstrated by partial proofs for graph-colouring problems
- Bounds and conjectures for the signless Laplacian index of graphs
- Star partitions and the graph isomorphism problem
- On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Title not available (Why is that?)
- Gazing: An approach to the problem of definition and lemma use
- \({\mathcal Z}\)-match: An inference rule for incrementally elaborating set instantiations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
- Title not available (Why is that?)
- A survey of automated conjectures in spectral graph theory
- Representations of graphs and networks (coding, layouts and embeddings)
Uses Software
This page was built for publication: Man-machine theorem proving in graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104124)
