Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A new reduction rule for the connection graph proof procedure

From MaRDI portal
Publication:1114445
Jump to:navigation, search

DOI10.1007/BF00297248zbMath0662.68103MaRDI QIDQ1114445

Klaus Heje Munch

Publication date: 1988

Published in: Journal of Automated Reasoning (Search for Journal in Brave)


zbMATH Keywords

resolutionautomated theorem provingconnection graphsorder-sorted logic


Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (2)

Reduction rules for resolution-based systems ⋮ A new subsumption method in the connection graph proof procedure



Cites Work

  • A mechanical solution of Schubert's steamroller by many-sorted resolution
  • Schubert's steamroller problem: Formulations and solutions
  • Automated deduction by theory resolution
  • On Matrices with Connections
  • An Evaluation of an Implementation of Qualified Hyperresolution
  • A Proof Procedure Using Connection Graphs
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: A new reduction rule for the connection graph proof procedure

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1114445&oldid=13157557"
Category:
  • Pages with script errors
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 03:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki