English
Related papers

Related papers: Ordering ambiguity versus representation

200 papers

Over time, there have hen refinements in the way that probability distributions are used for representing beliefs. Models which rely on single probability distributions depict a complete ordering among the propositions of interest, yet…

Artificial Intelligence · Computer Science 2013-02-28 Paul Snow

Complete axiomatizations and exponential-time decision procedures are provided for reasoning about knowledge and common knowledge when there are infinitely many agents. The results show that reasoning about knowledge and common knowledge…

Logic in Computer Science · Computer Science 2007-05-23 Joseph Y. Halpern , Richard A. Shore

This work analyses main features that should be present in knowledge representation. It suggests a model for representation and a way to implement this model in software. Representation takes care of both low-level sensor information and…

Artificial Intelligence · Computer Science 2007-05-23 Mikalai Birukou

We show that the quantum description of measurement based on decoherence fixes the bug in quantum theory discussed in [D. Frauchiger and R. Renner, {\em Quantum theory cannot consistently describe the use of itself}, Nat. Comm. {\bf 9},…

Quantum Physics · Physics 2018-10-17 Armando Relaño

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

Logic in Computer Science · Computer Science 2014-07-16 Arthur Milchior

We contemplate the notion of ambiguity in mathematical discourse. We consider a general method of resolving ambiguity and semantic options for sustaining a resolution. The general discussion is applied to the case of `fraction' which is…

Logic in Computer Science · Computer Science 2026-04-07 Jan A Bergstra , John V Tucker

Methods for choosing from a set of options are often based on a strict partial order on these options, or on a set of such partial orders. I here provide a very general axiomatic characterisation for choice functions of this form. It…

Artificial Intelligence · Computer Science 2020-04-03 Jasper De Bock

Opacity is a general language-theoretic framework in which several security properties of a system can be expressed. Its parameters are a predicate, given as a subset of runs of the system, and an observation function, from the set of runs…

Cryptography and Security · Computer Science 2019-02-20 B. Bérard , J. Mullins , M. Sassolas

Relational quantum queries are sometimes capable to effectively decide between collections of mutually exclusive elementary cases without completely resolving and determining those individual instances. Thereby the set of mutually exclusive…

Quantum Physics · Physics 2019-11-05 Karl Svozil

Unaided human decision making appears to systematically violate consistency constraints imposed by normative theories; these biases in turn appear to justify the application of formal decision-analytic models. It is argued that both claims…

Artificial Intelligence · Computer Science 2013-04-08 Marvin S. Cohen

We present here an overview of our work concerning entanglement properties of composite quantum systems. The characterization of entanglement, i.e. the possibility to assert if a given quantum state is entangled with others and how much…

Quantum Physics · Physics 2007-05-23 K. Eckert , O. Gühne , F. Hulpke , P. Hyllus , J. Korbicz , J. Mompart , D. Bruß , M. Lewenstein , A. Sanpera

The quality of rationales is essential in the reasoning capabilities of language models. Rationales not only enhance reasoning performance in complex natural language tasks but also justify model decisions. However, obtaining impeccable…

Computation and Language · Computer Science 2025-03-05 Hazel H. Kim

This paper illustrates the relationship between boolean propositional algebra and semirings, presenting some results of partial ordering on boolean propositional algebras, and the necessary conditions to represent a boolean propositional…

Rings and Algebras · Mathematics 2009-06-26 Mahesh Rudrachar , Shrisha Rao , Amit Raj

We consider a finite universe U (more exactly - a family U of them) and second order quantifiers Q_K, where for each U this means quantifying over a family of n(K)-place relations closed under permuting U. We define some natural orders and…

Logic · Mathematics 2016-09-07 Saharon Shelah

Algorithmic modeling relies on limited information in data to extrapolate outcomes for unseen scenarios, often embedding an element of arbitrariness in its decisions. A perspective on this arbitrariness that has recently gained interest is…

Machine Learning · Computer Science 2025-08-11 Prakhar Ganesh , Afaf Taik , Golnoosh Farnadi

Two important classes of quantum structures, namely orthomodular posets and orthomodular lattices, can be characterized in a classical context, using notions like partial information and points of view. Using the formalism of representation…

Quantum Physics · Physics 2007-05-23 Olivier Brunet

Uncertainty may be taken to characterize inferences, their conclusions, their premises or all three. Under some treatments of uncertainty, the inferences itself is never characterized by uncertainty. We explore both the significance of…

Artificial Intelligence · Computer Science 2013-02-18 Henry E. Kyburg

A model of knowledge representation is described in which propositional facts and the relationships among them can be supported by other facts. The set of knowledge which can be supported is called the set of cognitive units, each having…

Artificial Intelligence · Computer Science 2013-04-12 A. Julian Craddock , Roger A. Browse

I consider decision-making constrained by considerations of morality, rationality, or other virtues. The decision maker (DM) has a true preference over outcomes, but feels compelled to choose among outcomes that are top-ranked by some…

Theoretical Economics · Economics 2020-03-17 Sarah Ridout

In this paper, we give some generalizations the concept of element order and we study some of the properties of these generalized order. In particular, with using this generalization we derive two solvability criteria.

Group Theory · Mathematics 2020-03-24 Mohsen Amiri