Qualified logic programming with bivalued predicates
From MaRDI portal
Publication:2808238
Recommendations
Cites work
- scientific article; zbMATH DE number 4090844 (Why is no real title available?)
- scientific article; zbMATH DE number 1354157 (Why is no real title available?)
- scientific article; zbMATH DE number 2085246 (Why is no real title available?)
- scientific article; zbMATH DE number 1884400 (Why is no real title available?)
- Approximate reasoning by similarity-based SLD resolution.
- Contributions to the Theory of Logic Programming
- Formal properties of needed narrowing with similarity relations
- Fuzzy Prolog: A new approach using soft constraints propagation
- Programming with Fuzzy Logic and Mathematical Functions
- Quantitative Logic Programming Revisited
- Quantitative deduction and its fixpoint theory
- Similarity-based SLD resolution and its role for web knowledge discovery
- The Semantics of Predicate Logic as a Programming Language
Cited in
(10)- Quantitative Logic Programming Revisited
- Dedekind–MacNeille completion and Cartesian product of multi-adjoint lattices
- scientific article; zbMATH DE number 1337623 (Why is no real title available?)
- Qualified Computations in Functional Logic Programming
- Beyond multi-adjoint logic programming
- A transformation-based implementation for CLP with qualification and proximity
- Monotonic qualitative logic programs: computation and applications
- A declarative semantics for CLP with qualification and proximity
- Quantified logic programs, revisited
- scientific article; zbMATH DE number 4090844 (Why is no real title available?)
This page was built for publication: Qualified logic programming with bivalued predicates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808238)