Qualified logic programming with bivalued predicates
From MaRDI portal
Publication:2808238
DOI10.1016/J.ENTCS.2009.07.060zbMATH Open1337.68055OpenAlexW2014489281MaRDI QIDQ2808238FDOQ2808238
Authors: M. Rodríguez Artalejo, Carlos A. Romero-Díaz 
Publication date: 20 May 2016
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2009.07.060
Recommendations
Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- The Semantics of Predicate Logic as a Programming Language
- Quantitative deduction and its fixpoint theory
- Contributions to the Theory of Logic Programming
- Title not available (Why is that?)
- Approximate reasoning by similarity-based SLD resolution.
- Title not available (Why is that?)
- Quantitative Logic Programming Revisited
- Fuzzy Prolog: A new approach using soft constraints propagation
- Formal properties of needed narrowing with similarity relations
- Programming with Fuzzy Logic and Mathematical Functions
- Title not available (Why is that?)
- Similarity-based SLD resolution and its role for web knowledge discovery
- Title not available (Why is that?)
Cited In (10)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Quantitative Logic Programming Revisited
- Dedekind–MacNeille completion and Cartesian product of multi-adjoint lattices
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)
