Results 1  10
of
2,049
the Generalized Axiom of Revealed Preference in empirical studies of con
, 2012
"... I prove that as long as we allow the marginal utility for money () to vary between purchases (similarly to the budget) then the quasilinear and the ordinal budgetconstrained models rationalize the same data on consumer purchases. However, in the short run is approximately constant. I provide a s ..."
Abstract
 Add to MetaCart
I prove that as long as we allow the marginal utility for money () to vary between purchases (similarly to the budget) then the quasilinear and the ordinal budgetconstrained models rationalize the same data on consumer purchases. However, in the short run is approximately constant. I provide a simple constructive proof for the necessary and su ¢ cient condition for the constant rationalization, which I argue should replace
An O(n²) Algorithm for Testing the Generalized Axiom of Revealed Preference
"... This note presents an algorithm for testing the generalized axiom of revealed preference in time O(n²), where n is the number of observations in a given data set. Furthermore, we prove a lower bound of Ω(n log n) on the running time of any algorithm for testing different axioms of revealed preferen ..."
Abstract
 Add to MetaCart
This note presents an algorithm for testing the generalized axiom of revealed preference in time O(n²), where n is the number of observations in a given data set. Furthermore, we prove a lower bound of Ω(n log n) on the running time of any algorithm for testing different axioms of revealed
Axiomatic quantum field theory in curved spacetime
, 2008
"... The usual formulations of quantum field theory in Minkowski spacetime make crucial use of features—such as Poincare invariance and the existence of a preferred vacuum state—that are very special to Minkowski spacetime. In order to generalize the formulation of quantum field theory to arbitrary globa ..."
Abstract

Cited by 689 (18 self)
 Add to MetaCart
to a fundamental status, and, in essence, all of the properties of the quantum field theory are determined by its OPE. We provide general axioms for the OPE coefficients of a quantum field theory. These include a local and covariance assumption (implying that the quantum field theory is locally
Features of similarity.
 Psychological Review
, 1977
"... Similarity plays a fundamental role in theories of knowledge and behavior. It serves as an organizing principle by which individuals classify objects, form concepts, and make generalizations. Indeed, the concept of similarity is ubiquitous in psychological theory. It underlies the accounts of stimu ..."
Abstract

Cited by 1455 (2 self)
 Add to MetaCart
Similarity plays a fundamental role in theories of knowledge and behavior. It serves as an organizing principle by which individuals classify objects, form concepts, and make generalizations. Indeed, the concept of similarity is ubiquitous in psychological theory. It underlies the accounts
Pushing the EL envelope
 In Proc. of IJCAI 2005
, 2005
"... Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions, has better algorithmic properties than its counterpart FL0, which allows for conjunction and value restrictions. Whereas the subsumption problem in FL0 becomes already int ..."
Abstract

Cited by 461 (59 self)
 Add to MetaCart
intractable in the presence of acyclic TBoxes, it remains tractable in EL even with general concept inclusion axioms (GCIs). On the one hand, we extend the positive result for EL by identifying a set of expressive means that can be added to EL without sacrificing tractability. On the other hand, we show
The Fast Downward planning system
 Journal of Artifical Intelligence Research
, 2006
"... Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, including advanced features like ADL conditions and effects and derived predicates (axioms). Like other wellknown planne ..."
Abstract

Cited by 347 (29 self)
 Add to MetaCart
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, including advanced features like ADL conditions and effects and derived predicates (axioms). Like other well
Axioms for probability and belieffunction propagation
 Uncertainty in Artificial Intelligence
, 1990
"... In this paper, we describe an abstract framework and axioms under which exact local computation of marginals is possible. The primitive objects of the framework are variables and valuations. The primitive operators of the framework are combination and marginalization. These operate on valuations. We ..."
Abstract

Cited by 164 (23 self)
 Add to MetaCart
In this paper, we describe an abstract framework and axioms under which exact local computation of marginals is possible. The primitive objects of the framework are variables and valuations. The primitive operators of the framework are combination and marginalization. These operate on valuations
An Analysis of FirstOrder Logics of Probability
 Artificial Intelligence
, 1990
"... : We consider two approaches to giving semantics to firstorder logics of probability. The first approach puts a probability on the domain, and is appropriate for giving semantics to formulas involving statistical information such as "The probability that a randomly chosen bird flies is greater ..."
Abstract

Cited by 314 (17 self)
 Add to MetaCart
combined, allowing us to reason in a straightforward way about statistical information and degrees of belief. We then consider axiomatizing these logics. In general, it can be shown that no complete axiomatization is possible. We provide axiom systems that are sound and complete in cases where a complete
Axiom pinpointing in general tableaux
, 2010
"... Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing minimal (maximal) subsets of the knowledge base that have (do not have) the consequence in question. Most of the pinpoin ..."
Abstract

Cited by 41 (9 self)
 Add to MetaCart
Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing minimal (maximal) subsets of the knowledge base that have (do not have) the consequence in question. Most
Planning of Axiom Absorptions
"... Abstract. Absorptions are generally employed in Description Logics (DL) reasoners in a uniform way regardless of the structure of an input knowledge base. In this paper we present an approach to encode some stateoftheart absorption techniques into a state space planner, aiming to achieve a better ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
better solution. The planner applies appropriate operators to general axioms and produces a solution with a minimized cost to automatically organize these absorptions in a certain sequence to facilitate DL reasoning. Compared to predetermined or fixed applications of established absorptions, such a
Results 1  10
of
2,049