Results 1  10
of
2,606,564
Approximate Knowledge Compilation: The First Order Case
, 1996
"... Knowledge compilation procedures make a knowledge base more explicit so as make inference with respect to the compiled knowledge base tractable or at least more efficient. Most work to date in this area has been restricted to the propositional case, despite the importance of first order theories for ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
Knowledge compilation procedures make a knowledge base more explicit so as make inference with respect to the compiled knowledge base tractable or at least more efficient. Most work to date in this area has been restricted to the propositional case, despite the importance of first order theories
LOVELY PAIRS OF MODELS: THE NON FIRST ORDER CASE
"... Abstract. We prove that for every simple theory T (or even simple thick compact abstract theory) there is a (unique) compact abstract theory T P whose saturated models are the lovely pairs of T. Independencetheoretic results that were proved in [BPV03] when T P is a first order theory are proved fo ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We prove that for every simple theory T (or even simple thick compact abstract theory) there is a (unique) compact abstract theory T P whose saturated models are the lovely pairs of T. Independencetheoretic results that were proved in [BPV03] when T P is a first order theory are proved
Transformation of General Binary MRF Minimization to the First Order Case
 IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI
, 2011
"... Abstract—We introduce a transformation of general higherorder Markov random field with binary labels into a firstorder one that has the same minima as the original. Moreover, we formalize a framework for approximately minimizing higherorder multilabel MRF energies that combines the new reduction ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
Abstract—We introduce a transformation of general higherorder Markov random field with binary labels into a firstorder one that has the same minima as the original. Moreover, we formalize a framework for approximately minimizing higherorder multilabel MRF energies that combines the new reduction
LOVELY PAIRS OF MODELS: THE NON FIRST ORDER CASE ITAY BENYAACOV
, 902
"... Abstract. We prove that for every simple theory T (or even simple thick compact abstract theory) there is a (unique) compact abstract theory T P whose saturated models are the lovely pairs of T. Independencetheoretic results that were proved in [BPV03] when T P is a first order theory are proved fo ..."
Abstract
 Add to MetaCart
Abstract. We prove that for every simple theory T (or even simple thick compact abstract theory) there is a (unique) compact abstract theory T P whose saturated models are the lovely pairs of T. Independencetheoretic results that were proved in [BPV03] when T P is a first order theory are proved
The Viscosity Subdifferential of the Sum of Two Functions in Banach Spaces I: First Order Case
, 1996
"... this paper is to investigate subdifferential calculus for lower semicontinuous functions and to show that this calculus sheds a new light on the proof of uniqueness of viscosity solutions of HamiltonJacobi equations. In section 2, we give a formula for the viscosity subdifferential of the sum of tw ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
this paper is to investigate subdifferential calculus for lower semicontinuous functions and to show that this calculus sheds a new light on the proof of uniqueness of viscosity solutions of HamiltonJacobi equations. In section 2, we give a formula for the viscosity subdifferential of the sum of two uniformly continuous functions on spaces which admit a C
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
: 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
Five misunderstandings about casestudy research
 Qualitative Inquiry
, 2006
"... When I first became interested in indepth casestudy research, I was trying to understand how power and rationality shape each other and form the urban environments in which we live (Flyvbjerg, 1998). It was clear to me that in order to understand a complex issue like this, indepth casestudy rese ..."
Abstract

Cited by 556 (2 self)
 Add to MetaCart
When I first became interested in indepth casestudy research, I was trying to understand how power and rationality shape each other and form the urban environments in which we live (Flyvbjerg, 1998). It was clear to me that in order to understand a complex issue like this, indepth case
The Semantics of Predicate Logic as a Programming Language
 JOURNAL OF THE ACM
, 1976
"... Sentences in firstorder predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational seman ..."
Abstract

Cited by 808 (18 self)
 Add to MetaCart
Sentences in firstorder predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational
Cumulated Gainbased Evaluation of IR Techniques
 ACM Transactions on Information Systems
, 2002
"... Modem large retrieval environments tend to overwhelm their users by their large output. Since all documents are not of equal relevance to their users, highly relevant documents should be identified and ranked first for presentation to the users. In order to develop IR techniques to this direction, i ..."
Abstract

Cited by 694 (3 self)
 Add to MetaCart
Modem large retrieval environments tend to overwhelm their users by their large output. Since all documents are not of equal relevance to their users, highly relevant documents should be identified and ranked first for presentation to the users. In order to develop IR techniques to this direction
Results 1  10
of
2,606,564