A Declarative Semantics for CLP with Qualification and Proximity

Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause annotations based on uncertain truth values, qualification values as a generalization of uncertain truth values, and unification based on proximity relations. On the other hand, the CLP scheme has established itself as a powerful extension of LP that supports efficient computation over specialized domains while keeping a clean declarative semantics. In this paper we propose a new scheme SQCLP designed as an extension of CLP that supports qualification values and proximity relations. We show that several previous proposals can be viewed as particular cases of the new scheme, obtained by partial instantiation. We present a declarative semantics for SQCLP that is based on observables, providing fixpoint and proof-theoretical characterizations of least program models as well as an implementation-independent notion of goal solutions.Comment: 17 pages, 26th Int'l. Conference on Logic Programming (ICLP'10

Newton's "Experimental Philosophy"

My talk today will be about Newton’s avowed methodology, and specifically the place of experiment in his conception of science, and how his ideas changed significantly over the course of his career. I also want to look at his actual scientific practice and see how this influenced his views on the nature of the experimental sciences

DNF Sampling for ProbLog Inference

Inference in probabilistic logic languages such as ProbLog, an extension of Prolog with probabilistic facts, is often based on a reduction to a propositional formula in DNF. Calculating the probability of such a formula involves the disjoint-sum-problem, which is computationally hard. In this work we introduce a new approximation method for ProbLog inference which exploits the DNF to focus sampling. While this DNF sampling technique has been applied to a variety of tasks before, to the best of our knowledge it has not been used for inference in probabilistic logic systems. The paper also presents an experimental comparison with another sampling based inference method previously introduced for ProbLog.Comment: Online proceedings of the Joint Workshop on Implementation of Constraint Logic Programming Systems and Logic-based Methods in Programming Environments (CICLOPS-WLPE 2010), Edinburgh, Scotland, U.K., July 15, 201

Hierarchical fuzzy logic based approach for object tracking

In this paper a novel tracking approach based on fuzzy concepts is introduced. A methodology for both single and multiple object tracking is presented. The aim of this methodology is to use these concepts as a tool to, while maintaining the needed accuracy, reduce the complexity usually involved in object tracking problems. Several dynamic fuzzy sets are constructed according to both kinematic and non-kinematic properties that distinguish the object to be tracked. Meanwhile kinematic related fuzzy sets model the object's motion pattern, the non-kinematic fuzzy sets model the object's appearance. The tracking task is performed through the fusion of these fuzzy models by means of an inference engine. This way, object detection and matching steps are performed exclusively using inference rules on fuzzy sets. In the multiple object methodology, each object is associated with a confidence degree and a hierarchical implementation is performed based on that confidence degree.info:eu-repo/semantics/publishedVersio

Channels’ Confirmation and Predictions’ Confirmation: From the Medical Test to the Raven Paradox

After long arguments between positivism and falsificationism, the verification of universal hypotheses was replaced with the confirmation of uncertain major premises. Unfortunately, Hemple proposed the Raven Paradox. Then, Carnap used the increment of logical probability as the confirmation measure. So far, many confirmation measures have been proposed. Measure F proposed by Kemeny and Oppenheim among them possesses symmetries and asymmetries proposed by Elles and Fitelson, monotonicity proposed by Greco et al., and normalizing property suggested by many researchers. Based on the semantic information theory, a measure b* similar to F is derived from the medical test. Like the likelihood ratio, measures b* and F can only indicate the quality of channels or the testing means instead of the quality of probability predictions. Furthermore, it is still not easy to use b*, F, or another measure to clarify the Raven Paradox. For this reason, measure c* similar to the correct rate is derived. Measure c* supports the Nicod Criterion and undermines the Equivalence Condition, and hence, can be used to eliminate the Raven Paradox. An example indicates that measures F and b* are helpful for diagnosing the infection of Novel Coronavirus, whereas most popular confirmation measures are not. Another example reveals that all popular confirmation measures cannot be used to explain that a black raven can confirm “Ravens are black” more strongly than a piece of chalk. Measures F, b*, and c* indicate that the existence of fewer counterexamples is more important than more positive examples’ existence, and hence, are compatible with Popper’s falsification thought

Taking Mermin's Relational Interpretation of QM Beyond Cabello's and Seevinck's No-Go Theorems

In this paper we address a deeply interesting debate that took place at the end of the last millennia between David Mermin, Adan Cabello and Michiel Seevinck, regarding the meaning of relationalism within quantum theory. In a series of papers, Mermin proposed an interpretation in which quantum correlations were considered as elements of physical reality. Unfortunately, the very young relational proposal by Mermin was too soon tackled by specially suited no-go theorems designed by Cabello and Seevinck. In this work we attempt to reconsider Mermin's program from the viewpoint of the Logos Categorical Approach to QM. Following Mermin's original proposal, we will provide a redefinition of quantum relation which not only can be understood as a preexistent element of physical reality but is also capable to escape Cabello's and Seevinck's no-go-theorems. In order to show explicitly that our notion of ontological quantum relation is safe from no-go theorems we will derive a non-contextuality theorem. We end the paper with a discussion regarding the physical meaning of quantum relationalism.Comment: 19 pages, 1 phot