Qualified Logic Programming with Bivalued Predicates

DOI10.1016/j.entcs.2009.07.060zbMath1337.68055OpenAlexW2014489281MaRDI QIDQ2808238

Carlos A. Romero-Díaz, Mario Rodríguez Artalejo

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

zbMATH Keywords

threshold constraintsbivalued predicatesqualification domainsqualified logic programming

Mathematics Subject Classification ID

Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Beyond multi-adjoint logic programming ⋮ Dedekind–MacNeille completion and Cartesian product of multi-adjoint lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fuzzy Prolog: A new approach using soft constraints propagation
• Approximate reasoning by similarity-based SLD resolution.
• Similarity-based SLD resolution and its role for web knowledge discovery
• Formal Properties of Needed Narrowing with Similarity Relations
• Programming with Fuzzy Logic and Mathematical Functions
• Quantitative deduction and its fixpoint theory
• Contributions to the Theory of Logic Programming
• The Semantics of Predicate Logic as a Programming Language
• Quantitative Logic Programming Revisited

This page was built for publication: Qualified Logic Programming with Bivalued Predicates