Matings in matrices
From MaRDI portal
Publication:3668887
DOI10.1145/182.183zbMath0519.68078OpenAlexW2071915991MaRDI QIDQ3668887
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
Related Items
Accelerating tableaux proofs using compact representations, The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics, Constraint satisfaction from a deductive viewpoint, Linearity and plan generation, Parallel inference algorithms for the connection method on systolic arrays, Cardinality Restrictions Within Description Logic Connection Calculi, IeanCOP: lean connection-based theorem proving, On connections and higher-order logic, Automatic theorem proving. II, leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions), A Non-clausal Connection Calculus, A deductive solution for plan generation, Specifying and Verifying Organizational Security Properties in First-Order Logic, Machine learning guidance for connection tableaux, Generating plans in linear logic. I: Actions as proofs, Generating plans in linear logic. II: A geometry of conjunctive actions, nanoCoP: A Non-clausal Connection Prover, From Schütte’s Formal Systems to Modern Automated Deduction, Automated inferencing
