arXiv subjects

Ahmet Faruk Saz

Publications and source records attributed to Ahmet Faruk Saz.

7 recordsLinked to original sources

arXiv2026

Goal-Oriented Semantic Communication for Logical Decision Making

This paper develops a principled foundation for goal-oriented semantic communication for logical decision-making. Consider a setting where autonomous agents engage in collaborative perception. In such settings, the volume of sensory data and limited bandwidth often make transmission of raw observations infeasible, requiring intelligent selection of task-relevant information. Because these scenarios are safety-critical, the selection and decision processes must also be transparent and verifiable. To address this, we propose an explainable semantic communication framework grounded in a First-Order Logic (FOL) hierarchical representation of the world. We define semantic information, entropy, relative entropy, change in entropy, and mutual information by assigning an inductive logical probability measure over semantic structures in the language. Based on these definitions, we formulate a goal-oriented semantic communication objective through semantic rate-distortion theory and, equivalently, through the semantic information bottleneck principle. In this framework, task rules are represented as goal-oriented states, defined as a layer over the world states to capture decision-relevant abstractions. The resulting principle selects evidence that is most informative about these states, aiming to transmit only those FOL clauses most critical for decision-making while preserving logical verifiability. We demonstrate the effectiveness of the approach in a deduction-based safe path-following task within an FOL-based urban environment simulator with multiple dynamic agents.

cs.IT↗

arXiv2026

Goal-Oriented Logic-based Semantic Communication for Neuro-Symbolic Reasoning with Applications onto Autonomous Driving

We consider First-Order Logic (FOL)-based semantic communication for neuro-symbolic decision-making in collaborative environments such as autonomous driving networks. Each connected autonomous vehicle (CAV) converts its partial sensor observations into a natural-language scene description and corresponding grounded FOL evidence. Under an uplink budget, a semantic encoder at each car selects the observations most informative for evaluating traffic rules and transmit to a Road Side Unit (RSU). The RSU fuses all received evidence, evaluates collaborative rules, performs logical deduction for vehicle-specific safety and right-of-way information for constrained downlink transmission. Each CAV combines the received deductions with its local description, enabling a local LLM agent to select a high-level driving action. We develop a principled, verifiable semantic communication method using a random-support Dirichlet--Categorical model of inductive logical probability, providing a modern statistical reinterpretation of Carnap's and Hintikka's systems. From this model, we derive a goal-oriented semantic information-bottleneck formulation that prioritizes evidence transmission by its reduction of uncertainty over task goals. Using 152 traffic rules extracted from the California Driver Handbook, we evaluate the framework on MDrive simulator in CARLA. Under identical communication budgets, semantic evidence selection completes every scenario without safety hazards, whereas uniform evidence selection produces collisions, showcasing semantic communication's superiority.

cs.IT↗

arXiv2026

Analysis of Semantic Communication for Logic-based Hypothesis Deduction

This work presents an analysis of semantic communication in the context of First-Order Logic (FOL)-based deduction. Specifically, the receiver holds a set of hypotheses about the State of the World (SotW), while the transmitter has incomplete evidence about the true SotW but lacks access to the ground truth. The transmitter aims to communicate limited information to help the receiver identify the hypothesis most consistent with true SotW. We formulate the objective as approximating the posterior distribution of the transmitter at the receiver. Using Stirling's approximation, this reduces to a constrained, finite-horizon resource allocation problem. Applying the Karush-Kuhn-Tucker conditions yields a truncated water-filling solution. Despite the problem's non-convexity, symmetry and permutation invariance ensure global optimality. Based on this, we design message selection strategies, both for single- and multi- round communication, and model the receiver's inference as an $m$-ary Bayesian hypothesis testing problem. Under the Maximum A Posteriori (MAP) rule, our communication strategy achieves optimal performance within budget constraints. We further analyze convergence rates and validate the theoretical findings through experiments, demonstrating reduced error over random selection and prior methods.

cs.IT↗

arXiv2025

On The Theory of Semantic Information and Communication for Logical Inference

First-Order Logic (FOL), also called first-order predicate calculus, is a formal language that provides a framework to comprehensively represent a world and its present state, including all of its entities, attributes, and complex interrelations, irrespective of their physical modality (e.g., text, image, or sensor data). Grounded in this universal representation, this paper develops a mathematical theory for semantic information and communication tailored to tasks involving logical reasoning and inference. For semantic communication, our framework distinguishes between two fundamental components: the physical cost of transmitting symbols of the FOL language and the logical content those symbols represent. A calibrated measure for semantic content is proposed, which allows for the consistent comparison of information value across different logical systems. This measure quantifies the degree to which a message reduces uncertainty about the true state of the world. Building on this measure, semantic entropy, conditional and mutual information metrics are defined. These metrics are then used to formulate optimizable objectives for semantic communication, designed to preserve the information most relevant for logical reasoning task at the receiver while adhering to a transmission budget. The framework's operational value is demonstrated through experiments in semantic compression, where the proposed objectives are used to manage the trade-off between transmission cost and the preservation of logical content; and deductive inference, where increasing world-state awareness improves deduction performance.

cs.IT↗

arXiv2025

DISCD: Distributed Lossy Semantic Communication for Logical Deduction of Hypothesis

In this paper, we address hypothesis testing in a distributed network of nodes, where each node has only partial information about the State of the World (SotW) and is tasked with determining which hypothesis, among a given set, is most supported by the data available within the node. However, due to each node's limited perspective of the SotW, individual nodes cannot reliably determine the most supported hypothesis independently. To overcome this limitation, nodes must exchange information via an intermediate server. Our objective is to introduce a novel distributed lossy semantic communication framework designed to minimize each node's uncertainty about the SotW while operating under limited communication budget. In each communication round, nodes determine the most content-informative message to send to the server. The server aggregates incoming messages from all nodes, updates its view of the SotW, and transmits back the most semantically informative message. We demonstrate that transmitting semantically most informative messages enables convergence toward the true distribution over the state space, improving deductive reasoning performance under communication constraints. For experimental evaluation, we construct a dataset designed for logical deduction of hypotheses and compare our approach against random message selection. Results validate the effectiveness of our semantic communication framework, showing significant improvements in nodes' understanding of the SotW for hypothesis testing, with reduced communication overhead.

cs.IT↗

arXiv2024

Lossy Semantic Communication for the Logical Deduction of the State of the World

In this paper, we address the problem of lossy semantic communication to reduce uncertainty about the State of the World (SotW) for deductive tasks in point to point communication. A key challenge is transmitting the maximum semantic information with minimal overhead suitable for downstream applications. Our solution involves maximizing semantic content information within a constrained bit budget, where SotW is described using First-Order Logic, and content informativeness is measured by the usefulness of the transmitted information in reducing the uncertainty of the SotW perceived by the receiver. Calculating content information requires computing inductive logical probabilities of state descriptions; however, naive approaches are infeasible due to the massive size of the state space. To address this, our algorithm draws inspiration from state-of-the-art model counters and employs tree search-based model counting to reduce the computational burden. These algorithmic model counters, designed to count the number of models that satisfy a Boolean equation, efficiently estimate the number of world states that validate the observed evidence. Empirical validation using the FOLIO and custom deduction datasets demonstrate that our algorithm reduces uncertainty and improves task performance with fewer bits compared to baselines.

cs.IT↗

arXiv2021

Database Assisted Nonlinear Least Squares Algorithm for Visible Light Positioning in NLOS Environments

We propose an indoor localization algorithm for visible light systems by considering effects of non-line-of-sight (NLOS) propagation. The proposed algorithm, named database assisted nonlinear least squares (DA-NLS), utilizes ideas from both the classical NLS algorithm and the fingerprinting algorithm to achieve accurate and robust localization performance in NLOS environments. In particular, a database is used to learn NLOS effects, and then an NLS algorithm is employed to estimate the position. The performance of the proposed algorithm is compared against that of the fingerprinting and NLS algorithms.

eess.SP↗