Results 1  10
of
4,551
Efficient semantic matching
, 2004
"... We think of Match as an operator which takes two graphlike structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into prop ..."
Abstract

Cited by 855 (68 self)
 Add to MetaCart
into propositional formulas, and by codifying matching into a propositional unsatisfiability problem. We distinguish between problems with conjunctive formulas and problems with disjunctive formulas, and present various optimizations. For instance, we propose a linear time algorithm which solves the first class
Applications Of Circumscription To Formalizing Common Sense Knowledge
 Artificial Intelligence
, 1986
"... We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The applications in this paper are mostly based on minimizing the abnormality of different aspects o ..."
Abstract

Cited by 532 (12 self)
 Add to MetaCart
of various entities. Included are nonmonotonic treatments of isa hierarchies, the unique names hypothesis, and the frame problem. The new circumscription may be called formula circumscription to distinguish it from the previously defined domain circumscription and predicate circumscription. A still more
Uniform proofs as a foundation for logic programming
 ANNALS OF PURE AND APPLIED LOGIC
, 1991
"... A prooftheoretic characterization of logical languages that form suitable bases for Prologlike programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its ..."
Abstract

Cited by 428 (122 self)
 Add to MetaCart
. Horn clauses are then generalized to hereditary Harrop formulas and it is shown that firstorder and higherorder versions of this new class of formulas are also abstract logic programming languages if the inference rules are those of either intuitionistic or minimal logic. The programming language
Notes On Formalizing Context
, 1993
"... These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the propositions true in different contexts. Introducing contexts as formal objects will permit axiomatizat ..."
Abstract

Cited by 417 (9 self)
 Add to MetaCart
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the propositions true in different contexts. Introducing contexts as formal objects will permit
Original Article Intraocular Lens Power Calculation Using IOLMaster and Various Formulas in Short Eyes
"... Purpose: To evaluate the predictability of intraocular lens (IOL) power calculations using the IOLMaster and four different IOL power calculation formulas (Haigis, Hoffer Q, SRK II, and SRK/T) for cataract surgery in eyes with a short axial length (AL). Methods: The present study was a retrospective ..."
Abstract
 Add to MetaCart
Purpose: To evaluate the predictability of intraocular lens (IOL) power calculations using the IOLMaster and four different IOL power calculation formulas (Haigis, Hoffer Q, SRK II, and SRK/T) for cataract surgery in eyes with a short axial length (AL). Methods: The present study was a
CURRENT PAPERS A Review and Assessment of Various Formulae for Turbulent Skin Friction in Compressible Flow
"... It should be mentioned that many of the thcorzes developed for turbulent skin frwtlon 111 compresslblc flow stem from the pioneer work of Frank1 and voXhe94. 2 titensmn of mn.ge of vahhty of conclusion 6, p.31 A&Qtional expdm.mtal cvldence'5d8 now makes It possible to extend the comparisons ..."
Abstract
 Add to MetaCart
the comparisons shown m F1gs.3 and 7. This 1s done u Flg.10, Much shows thac both Rubesln's mterpolatlon formula (equation 33) and also equation 32b (resultmy from the assumption of constancy of velomty pmfdej give va~~az~ons of sku fmctlon m reasonable agreement rVlth expervnent at least up to M = 4.5. All
On the Hardness of Approximate Reasoning
, 1996
"... Many AI problems, when formalized, reduce to evaluating the probability that a propositional expression is true. In this paper we show that this problem is computationally intractable even in surprisingly restricted cases and even if we settle for an approximation to this probability. We consider va ..."
Abstract

Cited by 289 (13 self)
 Add to MetaCart
various methods used in approximate reasoning such as computing degree of belief and Bayesian belief networks, as well as reasoning techniques such as constraint satisfaction and knowledge compilation, that use approximation to avoid computational difficulties, and reduce them to modelcounting problems
ПРАКТИЧЕСКОЕ ЗНАЧЕНИЕ РАЗЛИЧНЫХ ФОРМУЛ РАСЧЕТА СКОРОСТИ КЛУБОЧКОВОЙ ФИЛЬТРАЦИИ У ДЕТЕЙ С ИСПОЛЬЗОВАНИЕМ ЭНДОГЕННЫХ МАРКЕРОВ PRACTICAL IMPORTANCE OF THE VARIOUS FORMULAS FOR CALCULATING OF GLOMERULAR FILTRATION RATE IN CHILDREN WITH ENDOGENOUS MARKERS
"... В статье представлены результаты применения нового маркера для определения функционального состояния почек в педиатрической практике цистатина С (Цис С). Цис С негликозилированный основной белок, продуцирующийся большинством ядросодержащих клеток с постоянной скоростью, низкая молекулярная масс ..."
Abstract
 Add to MetaCart
methods in children. PATIENTS AND METHODS: a total of 83 patients from 1 month to 17 years (mean age 4,15 ± 5,08 years) with various nephropathies. Results: were determined the serum concentration of cystatin C [1,28 (0,2, 2,4)] mg/L, creatinine [0,5 (0,3, 6,5)] mg % and GFR using formulas based
Nonperturbative formulas for central functions of supersymmetric gauge theories
 Nucl. Phys. B
, 1998
"... For quantum field theories that flow between ultraviolet and infrared fixed points, central functions, defined from twopoint correlators of the stress tensor and conserved currents, interpolate between central charges of the UV and IR critical theories. We develop techniques that allow one to calcu ..."
Abstract

Cited by 164 (27 self)
 Add to MetaCart
to calculate the flows of the central charges and that of the Euler trace anomaly coefficient in a general N=1 supersymmetric gauge theory. Exact, explicit formulas for SU(Nc) gauge theories in the conformal window are given and analysed. The Euler anomaly coefficient always satisfies the inequality aUV −a
An Algorithm to Evaluate Quantified Boolean Formulae and its Experimental Evaluation
 Journal of Automated Reasoning
, 1999
"... The high computational complexity of advanced reasoning tasks such as reasoning about knowledge and planning calls for efficient and reliable algorithms for reasoning problems harder than NP. In this paper we propose Evaluate, an algorithm for evaluating Quantified Boolean Formulae, a language that ..."
Abstract

Cited by 155 (5 self)
 Add to MetaCart
The high computational complexity of advanced reasoning tasks such as reasoning about knowledge and planning calls for efficient and reliable algorithms for reasoning problems harder than NP. In this paper we propose Evaluate, an algorithm for evaluating Quantified Boolean Formulae, a language
Results 1  10
of
4,551