Results 1 - 10 of 2,623

Logical foundations of object-oriented and frame-based languages

by Michael Kifer, Georg Lausen, James Wu - JOURNAL OF THE ACM , 1995
"... We propose a novel formalism, called Frame Logic (abbr., F-logic), that accounts in a clean and declarative fashion for most of the structural aspects of object-oriented and frame-based languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."
Abstract - Cited by 876 (65 self) - Add to MetaCart
, encapsulation, and others. In a sense, F-logic stands in the same relationship to the objectoriented paradigm as classical predicate calculus stands to relational programming. F-logic has a model-theoretic semantics and a sound and complete resolution-based proof theory. A small number of fundamental concepts

New results in linear filtering and prediction theory

by R. E. Kalman, R. S. Bucy - TRANS. ASME, SER. D, J. BASIC ENG , 1961
"... A nonlinear differential equation of the Riccati type is derived for the covariance matrix of the optimal filtering error. The solution of this "variance equation " completely specifies the optimal filter for either finite or infinite smoothing intervals and stationary or nonstationary sta ..."
Abstract - Cited by 607 (0 self) - Add to MetaCart
A nonlinear differential equation of the Riccati type is derived for the covariance matrix of the optimal filtering error. The solution of this "variance equation " completely specifies the optimal filter for either finite or infinite smoothing intervals and stationary or nonstationary

A Correspondence Theory for Terminological Logics: Preliminary Report

by Klaus Schild - In Proc. of IJCAI-91 , 1991
"... We show that the terminological logic ALC comprising Boolean operations on concepts and value restrictions is a notational variant of the propositional modal logic K (m) . To demonstrate the utility of the correspondence, we give two of its immediate by-products. Namely, we axiomatize ALC and give a ..."
Abstract - Cited by 307 (0 self) - Add to MetaCart
a simple proof that subsumption in ALC is PSPACE-complete, replacing the original six-page one. Furthermore, we consider an extension of ALC additionally containing both the identity role and the composition, union, transitive-reflexive closure, range restriction, and inverse of roles. It turns out

Computational Properties of Resolution-based Grounded Semantics

by Pietro Baroni, Paul E. Dunne, Massimiliano Giacomin
"... In the context of Dung’s theory of abstract argumentation frameworks, the recently introduced resolution-based grounded semantics features the unique property of fully complying with a set of general requirements, only partially satisfied by previous literature proposals. This paper contributes to t ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
In the context of Dung’s theory of abstract argumentation frameworks, the recently introduced resolution-based grounded semantics features the unique property of fully complying with a set of general requirements, only partially satisfied by previous literature proposals. This paper contributes

Overcoming Resolution-Based Lower Bounds for SAT Solvers

by unknown authors
"... Many leading-edge SAT solvers are based on the Davis-Putnam procedure or the Davis-Logemann-Loveland procedure, and thus on unsatisfiable instances they can be viewed as attempting to find refutations by resolution. Therefore, exponential lower bounds on the length of resolution proofs also apply to ..."
Abstract - Add to MetaCart
Many leading-edge SAT solvers are based on the Davis-Putnam procedure or the Davis-Logemann-Loveland procedure, and thus on unsatisfiable instances they can be viewed as attempting to find refutations by resolution. Therefore, exponential lower bounds on the length of resolution proofs also apply

One-Dimensional Dynamics

by Welington de Melo , Sebastian van Strien
"... One-dimensional dynamics has developed in the last decades into a subject in its own right. Yet, many recent results are inaccessible and have never been brought together. For this reason, we have tried to give a unified account of the subject and complete proofs of many results. To show what result ..."
Abstract - Cited by 267 (10 self) - Add to MetaCart
One-dimensional dynamics has developed in the last decades into a subject in its own right. Yet, many recent results are inaccessible and have never been brought together. For this reason, we have tried to give a unified account of the subject and complete proofs of many results. To show what

A Model-based Completeness Proof of Extended Narrowing and Resolution

by Jürgen Stuber , 2000
"... We give a proof of refutational completeness for Extended Narrowing And Resolution (ENAR), a calculus introduced by Dowek, Hardin and Kirchner in the context of Theorem Proving Modulo. ENAR integrates narrowing with respect to a set of rewrite rules on propositions into automated first-order theorem ..."
Abstract - Cited by 8 (3 self) - Add to MetaCart
We give a proof of refutational completeness for Extended Narrowing And Resolution (ENAR), a calculus introduced by Dowek, Hardin and Kirchner in the context of Theorem Proving Modulo. ENAR integrates narrowing with respect to a set of rewrite rules on propositions into automated first

A simpler approach to matrix completion

by Benjamin Recht - the Journal of Machine Learning Research
"... This paper provides the best bounds to date on the number of randomly sampled entries required to reconstruct an unknown low rank matrix. These results improve on prior work by Candès and Recht [4], Candès and Tao [7], and Keshavan, Montanari, and Oh [18]. The reconstruction is accomplished by minim ..."
Abstract - Cited by 158 (6 self) - Add to MetaCart
in the singular value decomposition. The proof of this assertion is short, self contained, and uses very elementary analysis. The novel techniques herein are based on recent work in quantum information theory.

COMPUTATIONALLY SOUND PROOFS

by Silvio Micali , 2000
"... This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a novel and meaningful framework, answers to old and new questions in complexity theory. In particular, given a random o ..."
Abstract - Cited by 117 (6 self) - Add to MetaCart
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a novel and meaningful framework, answers to old and new questions in complexity theory. In particular, given a random

Deciding Combinations of Theories

by Robert E. Shostak - JOURNAL OF THE ACM , 1984
"... A method is given for decidlng formulas in combinations of unquantified first-order theories. Rather than coupling separate decision procedures for the contributing theories, the method makes use of a single, uniform procedure that minimizes the code needed to accommodate each additional theory. It ..."
Abstract - Cited by 174 (0 self) - Add to MetaCart
, and others. A discussion of the speed performance of the procedure and a proof of the theorem that underhes ~ts completeness are also g~ven. The procedure has been used extensively asthe deductive core of a system for program specification and verification.
Results 1 - 10 of 2,623