Man-machine theorem proving in graph theory

DOI10.1016/0004-3702(88)90030-6zbMath0646.68107OpenAlexW1965876066MaRDI QIDQ1104124

Irena Pevac, Dragos 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

zbMATH Keywords

interactive programmingcomplexity measurecomputerized graph theory bibliographygraph theoretic algorithmsmechanical theorem prover

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (11)

Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs ⋮ Operational research models in action, the result of international cooperation -- a potpourri ⋮ Star partitions and the graph isomorphism problem ⋮ Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Gazing: An approach to the problem of definition and lemma use ⋮ A survey of automated conjectures in spectral graph theory ⋮ Bounds and conjectures for the signless Laplacian index of graphs ⋮ On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\) ⋮ Computers and discovery in algebraic graph theory ⋮ \({\mathcal Z}\)-match: An inference rule for incrementally elaborating set instantiations

Uses Software

• AFFIRM

Cites Work

• Theorem proving with abstraction
• Graph equations for line graphs and total graphs
• Non-resolution theorem proving
• A man-machine theorem-proving system
• Splitting and reduction heuristics in automatic theorem proving
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Man-machine theorem proving in graph theory