Topological Aspects of Matrix Abduction 2

DOI10.1007/978-3-319-15368-1_17zbMath1376.06003OpenAlexW2916859165MaRDI QIDQ5350344

Mai Ben Adar Bessos, Dov M. Gabbay

Publication date: 28 August 2017

Published in: Studies in Universal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15368-1_17

zbMATH Keywords

partially ordered setsgreedy algorithmsmatrix abductionbit-vector encodingsKal Vachomer

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Probability and inductive logic (03B48) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Other applications of logic (03B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of embedding orders into small products of chains
• Analysis of the Talmudic argumentum a fortiori inference rule (Kal Vachomer) using matrix abduction
• Computational aspects of the 2-dimension of partially ordered sets
• The road to universal logic. Festschrift for the 50th birthday of Jean-Yves Béziau. Volume II
• Exact matrix completion via convex optimization
• Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
• The Hardness of Approximating Poset Dimension
• Reducibility among Combinatorial Problems
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Topological Aspects of Matrix Abduction 2