Results 1  10
of
625
Software unit test coverage and adequacy
 ACM Computing Surveys
, 1997
"... Objective measurement of test quality is one of the key issues in software testing. It has been a major research focus for the last two decades. Many test criteria have been proposed and studied for this purpose. Various kinds of rationales have been presented in support of one criterion or another. ..."
Abstract

Cited by 351 (8 self)
 Add to MetaCart
Objective measurement of test quality is one of the key issues in software testing. It has been a major research focus for the last two decades. Many test criteria have been proposed and studied for this purpose. Various kinds of rationales have been presented in support of one criterion or another. We survey the research work in
Modal Languages And Bounded Fragments Of Predicate Logic
, 1996
"... Model Theory. These are nonempty families I of partial isomorphisms between models M and N , closed under taking restrictions to smaller domains, and satisfying the usual BackandForth properties for extension with objects on either side  restricted to apply only to partial isomorphisms of size ..."
Abstract

Cited by 271 (12 self)
 Add to MetaCart
Model Theory. These are nonempty families I of partial isomorphisms between models M and N , closed under taking restrictions to smaller domains, and satisfying the usual BackandForth properties for extension with objects on either side  restricted to apply only to partial isomorphisms of size at most k . 'Invariance for kpartial isomorphism' means having the same truth value at tuples of objects in any two models that are connected by a partial isomorphism in such a set. The precise sense of this is spelt out in the following proof. 21 Proof (Outline.) kvariable formulas are preserved under partial isomorphism, by a simple induction. More precisely, one proves, for any assignment A and any partial isomorphism IÎI which is defined on the Avalues for all variables x 1 , ..., x k , that M, A = f iff N , IoA = f . The crucial step in the induction is the quantifier case. Quantified variables are irrelevant to the assignment, so that the relevant partial isomorphism can be res...
Levelwise Search and Borders of Theories in Knowledge Discovery
, 1997
"... One of the basic problems in knowledge discovery in databases (KDD) is the following: given a data set r, a class L of sentences for defining subgroups of r, and a selection predicate, find all sentences of L deemed interesting by the selection predicate. We analyze the simple levelwise algorithm fo ..."
Abstract

Cited by 261 (15 self)
 Add to MetaCart
One of the basic problems in knowledge discovery in databases (KDD) is the following: given a data set r, a class L of sentences for defining subgroups of r, and a selection predicate, find all sentences of L deemed interesting by the selection predicate. We analyze the simple levelwise algorithm for finding all such descriptions. We give bounds for the number of database accesses that the algorithm makes. For this, we introduce the concept of the border of a theory, a notion that turns out to be surprisingly powerful in analyzing the algorithm. We also consider the verification problem of a KDD process: given r and a set of sentences S ` L, determine whether S is exactly the set of interesting statements about r. We show strong connections between the verification problem and the hypergraph transversal problem. The verification problem arises in a natural way when using sampling to speed up the pattern discovery step in KDD.
Domain Theory in Logical Form
 Annals of Pure and Applied Logic
, 1991
"... The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: • Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for denotational semantics. • The theory of concurrency and system ..."
Abstract

Cited by 252 (10 self)
 Add to MetaCart
(Show Context)
The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: • Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for denotational semantics. • The theory of concurrency and systems behaviour developed by Milner, Hennessy et al. based on operational semantics. • Logics of programs. Stone duality provides a junction between semantics (spaces of points = denotations of computational processes) and logics (lattices of properties of processes). Moreover, the underlying logic is geometric, which can be computationally interpreted as the logic of observable properties—i.e. properties which can be determined to hold of a process on the basis of a finite amount of information about its execution. These ideas lead to the following programme:
What you always wanted to know about Datalog (and never dared to ask)
 IEEE TRANSACTIONS KNOWLEDGE AND DATA ENGINEERING
, 1989
"... Datalog is a database query language based on the logic programming paradigm; it has been designed and intensively studied over the last five years. We present the syntax and semantics of Datalog and its use for querying a relational database. Then, we classify optimization methods for achieving eff ..."
Abstract

Cited by 196 (3 self)
 Add to MetaCart
Datalog is a database query language based on the logic programming paradigm; it has been designed and intensively studied over the last five years. We present the syntax and semantics of Datalog and its use for querying a relational database. Then, we classify optimization methods for achieving efficient evaluations of Datalog queries, and present the most relevant methods. Finally, we discuss various exhancements of Datalog, currently under study, and indicate what is still needed in order to extend Datalog’s applicability to the solution of reallife problems. The aim of this paper is to provide a survey of research performed on Datalog, also addressed to those members of the database community who are not too familiar with logic programming concepts.
Representational content in humans and machines
 Journal of Experimental and Theoretical Artificial Intelligence
, 1993
"... Representational content in humans and ..."
Categorical Logic
 A CHAPTER IN THE FORTHCOMING VOLUME VI OF HANDBOOK OF LOGIC IN COMPUTER SCIENCE
, 1995
"... ..."
Model Theory and Modules
, 1988
"... The modeltheoretic investigation of modules has led to ideas, techniques and results which are of algebraic interest, irrespective of their modeltheoretic significance. It is these aspects that I will discuss in this article, although I will make some comments on the model theory of modules per se ..."
Abstract

Cited by 96 (23 self)
 Add to MetaCart
The modeltheoretic investigation of modules has led to ideas, techniques and results which are of algebraic interest, irrespective of their modeltheoretic significance. It is these aspects that I will discuss in this article, although I will make some comments on the model theory of modules per se. Our default is that the term “module ” will mean (unital) right module over a ring (associative with 1) R. The category of such modules is denoted ModR, the full subcategory of finitely presented modules will be denoted modR, the
Fixedpoint extensions of firstorder logic
 in “Proceedings, 26th Annu. IEEE Symposium on Foundations of Computer Science
, 1985
"... Communicated byA. Nerode ..."
Horn clauses and database dependencies
 Journal of the ACM
, 1982
"... Abstract. Certain firstorder sentences, called "dependencies, " about relations in a database are defined and studied. These dependencies seem to include all prewously defined dependencies as special cases A new concept is mtroduced, called "faithfulness (with respect to ..."
Abstract

Cited by 89 (7 self)
 Add to MetaCart
(Show Context)
Abstract. Certain firstorder sentences, called &quot;dependencies, &quot; about relations in a database are defined and studied. These dependencies seem to include all prewously defined dependencies as special cases A new concept is mtroduced, called &quot;faithfulness (with respect to direct product), &quot; which enables powerful results to be proved about the existence of &quot;Armstrong relations &quot; in the presence of these new dependencies. (An Armstrong relaUon is a relation that obeys precisely those dependencies that are the logical consequences of a given set of dependencies.) Results are also obtained about characterizing the class of projections of those relations that obey a given set of dependencies.