Querying with Łukasiewicz logic

12/03/2015
by   Stefano Aguzzoli, et al.
0

In this paper we present, by way of case studies, a proof of concept, based on a prototype working on a automotive data set, aimed at showing the potential usefulness of using formulas of Łukasiewicz propositional logic to query databases in a fuzzy way. Our approach distinguishes itself for its stress on the purely linguistic, contraposed with numeric, formulations of queries. Our queries are expressed in the pure language of logic, and when we use (integer) numbers, these stand for shortenings of formulas on the syntactic level, and serve as linguistic hedges on the semantic one. Our case-study queries aim first at showing that each numeric-threshold fuzzy query is simulated by a Łukasiewicz formula. Then they focus on the expressing power of Łukasiewicz logic which easily allows for updating queries by clauses and for modifying them through a potentially infinite variety of linguistic hedges implemented with a uniform syntactic mechanism. Finally we shall hint how, already at propositional level, Łukasiewicz natural semantics enjoys a degree of reflection, allowing to write syntactically simple queries that semantically work as meta-queries weighing the contribution of simpler ones.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/01/2018

A van Benthem Theorem for Fuzzy Modal Logic

We present a fuzzy (or quantitative) version of the van Benthem theorem,...
research
06/11/2023

Resolution for Constrained Pseudo-Propositional Logic

This work, shows how propositional resolution can be generalized to obta...
research
01/16/2013

A Complete Calculus for Possibilistic Logic Programming with Fuzzy Propositional Variables

In this paper we present a propositional logic programming language for ...
research
07/18/2022

Conjunctive Queries, Existentially Quantified Systems of Equations and Finite Substitutions

This report presents an elementary theory of unification for positive co...
research
03/02/2021

Natural deduction for intuitionistic belief: proof theory and proof-theoretic semantics

Intuitionistic belief has been axiomatized by Artemov and Protopopescu a...
research
04/14/2023

Rethinking Existential First Order Queries and their Inference on Knowledge Graphs

Reasoning on knowledge graphs is a challenging task because it utilizes ...
research
10/12/2021

Reverse Engineering Code Dependencies: Converting Integer-Based Variability to Propositional Logic

A number of SAT-based analysis concepts and tools for software product l...

Please sign up or login with your details

Forgot password? Click here to reset