Artificial Intelligence
Quantitative deduction and its fixpoint theory
Journal of Logic Programming
The implementation of fprolog—a fuzzy prolog interpreter
Fuzzy Sets and Systems
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
International Journal of Approximate Reasoning
Temporal logic programming is complete and expressive
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resolution principles in possibilistic logic
International Journal of Approximate Reasoning
On the semantics of fuzzy logic
International Journal of Approximate Reasoning
Handbook of theoretical computer science (vol. B)
Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
Abstract interpretation and application to logic programs
Journal of Logic Programming
Probabilistic logic programming
Information and Computation
A logic for approximate reasoning
Journal of Symbolic Logic
Probabilistic deductive databases
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Evolutionary computation: toward a new philosophy of machine intelligence
Evolutionary computation: toward a new philosophy of machine intelligence
On-line algorithms for satisfiability problems with uncertainty
Selected papers from the international workshop on Uncertainty in databases and deductive systems
Fuzzy Logic and the Resolution Principle
Journal of the ACM (JACM)
Foundations of Neuro-Fuzzy Systems
Foundations of Neuro-Fuzzy Systems
On the Semantics of Rule-Based Expert Systems with Uncertainty
ICDT '88 Proceedings of the 2nd International Conference on Database Theory
LearnMiner: deductive, tolerant agents for discovering didactic resources on the web
SEKE '02 Proceedings of the 14th international conference on Software engineering and knowledge engineering
A Similarity-Based Unification Model for Flexible Querying
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
Editorial: fuzzy set and possibility theory-based methods in artificial intelligence
Artificial Intelligence - Special issue: Fuzzy set and possibility theory-based methods in artificial intelligence
Combining fuzzy logic and behavioral similarity for non-strict program validation
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Formal Properties of Needed Narrowing with Similarity Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
Representing Uncertainty in RuleML
Fundamenta Informaticae
Similarity-based reasoning in qualified logic programming
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
An improved reductant calculus using fuzzy partial evaluation techniques
Fuzzy Sets and Systems
Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
A hybrid programming scheme combining fuzzy-logic and functional-logic resources
Fuzzy Sets and Systems
A Similarity-Based WAM for Bousi~Prolog
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
On the Declarative Semantics of Multi-Adjoint Logic Programs
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Qualified Logic Programming with Bivalued Predicates
Electronic Notes in Theoretical Computer Science (ENTCS)
Bousi~Prolog: a Prolog Extension Language for Flexible Query Answering
Electronic Notes in Theoretical Computer Science (ENTCS)
A declarative semantics for Bousi~Prolog
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Qualified Computations in Functional Logic Programming
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Annals of Mathematics and Artificial Intelligence
A declarative semantics for clp with qualification and proximity*
Theory and Practice of Logic Programming
Determination of α-resolution in lattice-valued first-order logic LF(X)
Information Sciences: an International Journal
A sound semantics for a similarity-based logic programming language
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Programming with fuzzy logic and mathematical functions
WILF'05 Proceedings of the 6th international conference on Fuzzy Logic and Applications
Representing Uncertainty in RuleML
Fundamenta Informaticae
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advences in computational intelligence - Volume Part II
A Fuzzy linguistic prolog and its applications
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Hi-index | 5.23 |
In (Gerla and Sessa, Fuzzy Logic and Soft Computing, Kluwer, Norwell, 1999, pp. 19-31) a methodology that allows to manage uncertain and imprecise information in the frame of the declarative paradigm of Logic Programming has been proposed. With this aim, a Similarity relation R between function and predicate symbols in the language of a logic program is considered. Approximate inferences are then possible since similarity relation allows us to manage alternative instances of entities that can be considered "equal" with a given degree. The declarative semantics of the proposed transformation technique of logic programs is analyzed. The notion of fuzzy least Herbrand model is also introduced. In this paper the corresponding operational semantics is provided by introducing a modified version of SLD resolution. This top-down refutation procedure overcomes failure situations in the unification process by using the similarity relation. A generalized notion of most general unifier provides a numeric value which gives a measure of the exploited approximation. In this way, the SLD resolution is enhanced since it is possible both to handle uncertain or imprecise information, and to compute approximate answer substitutions, with an associated approximation-degree, when failures of the exact inference process occur. It can lead to the implementation of a more general PROLOG interpreter, without detracting from the elegance of the language.