English
Related papers

Related papers: Dialectical Roots for Interest Prohibition Theory

200 papers

Classical Decision Theory provides a normative framework for representing and reasoning about complex preferences. Straightforward application of this theory to automate decision making is difficult due to high elicitation cost. In response…

Artificial Intelligence · Computer Science 2013-01-30 Vu A. Ha , Peter Haddawy

Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…

General Mathematics · Mathematics 2007-05-23 Alexander Sakharov

The introduction of explicit notions of rejection, or disbelief, into logics for knowledge representation can be justified in a number of ways. Motivations range from the need for versions of negation weaker than classical negation, to the…

Artificial Intelligence · Computer Science 2007-05-23 Samir Chopra , Johannes Heidema , Thomas Meyer

This paper investigates the prospects of using directive explanations to assist people in achieving recourse of machine learning decisions. Directive explanations list which specific actions an individual needs to take to achieve their…

Machine Learning · Computer Science 2021-02-05 Ronal Singh , Paul Dourish , Piers Howe , Tim Miller , Liz Sonenberg , Eduardo Velloso , Frank Vetere

We consider the problem of automatically proving resource bounds. That is, we study how to prove that an integer-valued resource variable is bounded by a given program expression. Automatic resource-bound analysis has recently received…

Programming Languages · Computer Science 2021-10-15 Tianhan Lu , Bor-Yuh Evan Chang , Ashutosh Trivedi

In this paper an interesting application of mathematics in economics is presented: the formulation of the theory of consumer basic problem, grounded on the concept of preferences relation and operationalized with optimization tools.

Optimization and Control · Mathematics 2021-11-10 Manuel Alberto M. Ferreira , José António Filipe

We study linear regressions in a context where the outcome of interest and some of the covariates are observed in two different datasets that cannot be matched. Traditional approaches obtain point identification by relying, often…

Econometrics · Economics 2025-11-18 Xavier D'Haultfoeuille , Christophe Gaillac , Arnaud Maurel

Path independence is arguably one of the most important choice rule properties in economic theory. We show that a choice rule is path independent if and only if it is rationalizable by a utility function satisfying ordinal concavity, a…

Theoretical Economics · Economics 2024-05-30 Koji Yokote , Isa E. Hafalir , Fuhito Kojima , M. Bumin Yenmez

We prove that for the intermediate logics with the disjunction property any basis of admissible rules can be reduced to a basis of admissible m-rules (multiple-conclusion rules), and every basis of admissible m-rules can be reduced to a…

Logic · Mathematics 2015-09-03 Alex Citkin

Although conventional logical systems based on logical calculi have been successfully used in mathematics and beyond, they have definite limitations that restrict their application in many cases. For instance, the principal condition for…

Logic in Computer Science · Computer Science 2011-04-11 Mark Burgin , Kees , de Vey Mestdagh

This paper explores goal-directed proof search in first-order multi-modal logic. The key issue is to design a proof system that respects the modularity and locality of assumptions of many modal logics. By forcing ambiguities to be…

Logic in Computer Science · Computer Science 2007-05-23 Matthew Stone

We present a definition of cause and effect in terms of decision-theoretic primitives and thereby provide a principled foundation for causal reasoning. Our definition departs from the traditional view of causation in that causal assertions…

Artificial Intelligence · Computer Science 2014-11-17 D. Heckerman , R. Shachter

This paper studies axioms for nonmonotonic consequences from a semantics-based point of view, focusing on a class of mathematical structures for reasoning about partial information without a predefined syntax/logic. This structure is called…

Logic in Computer Science · Computer Science 2007-05-23 Guo-Qiang Zhang

We observe that justification logic enjoys a form the strong finite model property (sometimes also called small model property). Thus we obtain decidability proofs for justification logic that do not rely on Post's theorem.

Logic in Computer Science · Computer Science 2015-06-24 Thomas Studer

We introduce and investigate a family of consequence relations with the goal of capturing certain important patterns of data-driven inference. The inspiring idea for our framework is the fact that data may reject, possibly to some degree,…

Logic · Mathematics 2024-08-23 Paolo Baldi , Esther Anna Corsi , Hykel Hosni

In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant characterization of the existence and multiplicity of…

Artificial Intelligence · Computer Science 2007-05-23 Bart Verheij

In this work we generalize standard Decision Theory by assuming that two outcomes can also be incomparable. Two motivating scenarios show how incomparability may be helpful to represent those situations where, due to lack of information,…

Computer Science and Game Theory · Computer Science 2014-04-04 Piero A. Bonatti , Marco Faella , Luigi Sauro

An ordinal view of independence is studied in the framework of possibility theory. We investigate three possible definitions of dependence, of increasing strength. One of them is the counterpart to the multiplication law in probability…

Artificial Intelligence · Computer Science 2013-02-28 Didier Dubois , Luis Farinas del Cerro , Andreas Herzig , Henri Prade

This paper introduces epistemic graphs as a generalization of the epistemic approach to probabilistic argumentation. In these graphs, an argument can be believed or disbelieved up to a given degree, thus providing a more fine--grained…

Artificial Intelligence · Computer Science 2020-01-15 Anthony Hunter , Sylwia Polberg , Matthias Thimm

Evidential reasoning is cast as the problem of simplifying the evidence-hypothesis relation and constructing combination formulas that possess certain testable properties. Important classes of evidence as identifiers, annihilators, and…

Artificial Intelligence · Computer Science 2013-04-11 Yizong Cheng , Rangasami L. Kashyap