Towards the Use of Hypergraphs in Multi-adjoint Logic Programming
From MaRDI portal
Towards the Use of Hypergraphs in Multi-adjoint Logic Programming
Recommendations
- Beyond multi-adjoint logic programming
- Extended multi-adjoint logic programming
- scientific article; zbMATH DE number 1638651
- scientific article; zbMATH DE number 2085246
- scientific article; zbMATH DE number 1884400
- scientific article; zbMATH DE number 1931696
- On graph calculi for multi-modal logics
- Hybrid logic with the difference modality for generalisations of graphs
Cites work
- Algorithms for testing the satisfiability of propositional formulae
- Directed hypergraphs and applications
- Directed hypergraphs: introduction and fundamental algorithms -- a survey
- Fuzzy logic programming
- Gainfree Leontief substitution flow problems
- scientific article; zbMATH DE number 3900787 (Why is no real title available?)
- scientific article; zbMATH DE number 1844513 (Why is no real title available?)
- scientific article; zbMATH DE number 1884400 (Why is no real title available?)
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Logics in Artificial Intelligence
- Termination of logic programs with imperfect information: applications and query procedure
Cited in
(5)- Mapping Fusion and Synchronized Hyperedge Replacement into logic programming
- Fuzzy logic programs as hypergraphs. Termination results
- Using Multigraphs to Study the Interaction Between Opposition, Implication and Duality Relations in Logical Squares
- A study on multi-dimensional products of graphs and hybrid logics
- Hypergraphs in logic programming
This page was built for publication: Towards the Use of Hypergraphs in Multi-adjoint Logic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215753)
