Topological aspects of matrix abduction. II
DOI10.1007/978-3-319-15368-1_17zbMATH Open1376.06003OpenAlexW2916859165MaRDI QIDQ5350344FDOQ5350344
Authors: Mai Ben Adar Bessos, Dov 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
Recommendations
- Topological aspects of matrix abduction. I
- A minimal completion of \((0,1)\)-matrices without total support
- An efficient algorithm of deriving a Hasse diagram from the reachability matrix of a partial order relation and its application to cognitive diagnosis
- scientific article; zbMATH DE number 2185737
- scientific article; zbMATH DE number 736305
Probability and inductive logic (03B48) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorics of partially ordered sets (06A07) Other applications of logic (03B80)
Cites Work
- Exact matrix completion via convex optimization
- Reducibility among Combinatorial Problems
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Title not available (Why is that?)
- Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
- The Hardness of Approximating Poset Dimension
- The complexity of embedding orders into small products of chains
- Title not available (Why is that?)
- Computational aspects of the 2-dimension of partially ordered sets
- Title not available (Why is that?)
- Analysis of the Talmudic argumentum a fortiori inference rule (Kal Vachomer) using matrix abduction
- The road to universal logic. Festschrift for the 50th birthday of Jean-Yves Béziau. Volume II
Cited In (3)
This page was built for publication: Topological aspects of matrix abduction. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5350344)
