Results 251 to 260 of about 977,806 (290)

Probabilisitc Logic Programming under Maximum Entropy

1999
In this paper, we focus on the combination of probabilistic logic programming with the principle of maximum entropy. We start by defining probabilistic queries to probabilistic logic programs and their answer substitutions under maximum entropy. We then present an efficient linear programming characterization for the problem of deciding whether a ...
Thomas Lukasiewicz, Gabriele Kern-Isberner   +1 more
openaire   +1 more source

Logical Conditioning and Entropy Inference Based on Observational Data

Open Systems & Information Dynamics, 2001
The logical conditioning inference problem is studied when a simple condition setting a threshold for a potential observation of a scalar observable uncertain quantity is introduced as an additional information to the pieces of evidence originally available to make inference, which include observational data.
Solana-Ortega, Alberto, Solana, Vicente
openaire   +1 more source

Exact computation of the entropy of a logic circuit

Proceedings of the Sixth Great Lakes Symposium on VLSI, 2002
Computing the entropy of a digital circuit has proved to be very useful for several applications in the area of VLSI system design. Recently, a method for entropy calculation has been used in the context of power estimation for logic circuits described at the register-transfer level.
MACII, Enrico, PONCINO, MASSIMO
openaire   +1 more source

Top-H Decoding: Adapting the Creativity and Coherence with Bounded Entropy in Text Generation

arXiv.org
Large language models (LLMs), despite their impressive performance across a wide range of tasks, often struggle to balance two competing objectives in open-ended text generation: fostering diversity and creativity while preserving logical coherence ...
Erfan Baghaei Potraghloo, Seyedarmin Azizi, Souvik Kundu, M. Pedram   +3 more
semanticscholar   +1 more source

The entropy of observables on quantum logic

Reports on Mathematical Physics, 1984
Let L be a quantum logic, i.e., L is an orthocomplemented, orthomodular \(\sigma\)-lattice. Let A be an observable (i.e., \(\sigma\)-homomorphism from the Borel subsets \(B({\mathbb{R}}_ 1)\) into L), and let \(\alpha\) be a state, i.e., a probability measure on L. The resolution of 1 with respect to an observable A is a set \(M\subset \{A(E):\) \(E\in
openaire   +2 more sources

A New Logical Measure for Quantum Information

Quantum information & computation
Starting at the logical level of the logic of partitions, dual to the usual Boolean logic of subsets, the notion of logical entropy, i.e., information as distinctions, is developed as the quantification of the distinctions of partitions—just as ...
David P. Ellerman
semanticscholar   +1 more source

Erasure cost of a quantum process: a thermodynamic meaning of the dynamical min-entropy

Quantum Science and Technology
The erasure of information is fundamentally an irreversible logical operation, carrying profound consequences for the energetics of computation and information processing.
Himanshu Badhani, Dhanuja Gs, Swati Choudhary, Vishal Anand, Siddhartha Das   +4 more
semanticscholar   +1 more source

Entropy-Based Adaptive Weighting for Self-Training

arXiv.org
The mathematical problem-solving capabilities of large language models have become a focal point of research, with growing interests in leveraging self-generated reasoning paths as a promising way to refine and enhance these models.
Xiaoxuan Wang, Yihe Deng, Mingyu Derek Ma, Wei Wang   +3 more
semanticscholar   +1 more source

Entropy in operational statistics and quantum logic

Foundations of Physics, 1979
In a series of recent papers, Randall and Foulis have developed a generalized theory of probability (operational statistics) which is based on the notion of a physical operation. They have shown that the quantum logic description of quantum mechanics can be naturally imbedded into this generalized theory of probability.
openaire   +1 more source

Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra

arXiv.org
We propose using confusion hypergraphs (hyperconfusions) as a model of information. In contrast to the conventional approach using random variables, we can now perform conjunction, disjunction and implication of information, forming a Heyting algebra ...
Cheuk Ting Li
semanticscholar   +1 more source