Matings in matrices

DOI10.1145/182.183MaRDI QIDQ3668887zbMATH OpenOpenAlexFDO

Authors Wolfgang Bibel

Publication date 1983

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/182.183

zbMATH Keywords

connection methodmatings

Mathematics Subject Classification ID

Cited in

(22)

• Automated inferencing
• Constraint satisfaction from a deductive viewpoint
• Linearity and plan generation
• Accelerating tableaux proofs using compact representations
• IeanCOP: lean connection-based theorem proving
• Generating plans in linear logic. I: Actions as proofs
• Generating plans in linear logic. II: A geometry of conjunctive actions
• Machine learning guidance for connection tableaux
• The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics
• nanoCoP: a non-clausal connection prover
• A Non-clausal Connection Calculus
• Specifying and verifying organizational security properties in first-order logic
• leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
• Automatic theorem proving. II
• Parallel inference algorithms for the connection method on systolic arrays
• From Schütte’s Formal Systems to Modern Automated Deduction
• A deductive solution for plan generation
• Cardinality Restrictions Within Description Logic Connection Calculi
• Automatic acquisition of search guiding heuristics
• On structures of sign-boundary and diagonal vacancy-type standard contradictions
• Finding connections via satisfiability solving
• On connections and higher-order logic

This page was built for publication: Matings in matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3668887)