Results 1  10
of
638
Markov Logic Networks
 MACHINE LEARNING
, 2006
"... We propose a simple approach to combining firstorder logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a firstorder knowledge base with a weight attached to each formula (or clause). Together with a set of constants representing objects in the ..."
Abstract

Cited by 816 (39 self)
 Add to MetaCart
We propose a simple approach to combining firstorder logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a firstorder knowledge base with a weight attached to each formula (or clause). Together with a set of constants representing objects
A Theory of Diagnosis from First Principles
 ARTIFICIAL INTELLIGENCE
, 1987
"... Suppose one is given a description of a system, together with an observation of the system's behaviour which conflicts with the way the system is meant to behave. The diagnostic problem is to determine those components of the system which, when assumed to be functioning abnormally, will explain ..."
Abstract

Cited by 1120 (5 self)
 Add to MetaCart
, will explain the discrepancy between the observed and correct system behaviour. We propose a general theory for this problem. The theory requires only that the system be described in a suitable logic. Moreover, there are many such suitable logics, e.g. firstorder, temporal, dynamic, etc. As a result
Computing With FirstOrder Logic
, 1995
"... We study two important extensions of firstorder logic (FO) with iteration, the fixpoint and while queries. The main result of the paper concerns the open problem of the relationship between fixpoint and while: they are the same iff ptime = pspace. These and other expressibility results are obtaine ..."
Abstract

Cited by 55 (13 self)
 Add to MetaCart
We study two important extensions of firstorder logic (FO) with iteration, the fixpoint and while queries. The main result of the paper concerns the open problem of the relationship between fixpoint and while: they are the same iff ptime = pspace. These and other expressibility results
HiLog: A foundation for higherorder logic programming
 JOURNAL OF LOGIC PROGRAMMING
, 1993
"... We describe a novel logic, called HiLog, and show that it provides a more suitable basis for logic programming than does traditional predicate logic. HiLog has a higherorder syntax and allows arbitrary terms to appear in places where predicates, functions and atomic formulas occur in predicate calc ..."
Abstract

Cited by 252 (42 self)
 Add to MetaCart
calculus. But its semantics is firstorder and admits a sound and complete proof procedure. Applications of HiLog are discussed, including DCG grammars, higherorder and modular logic programming, and deductive databases.
On FirstOrder Topological Queries
 IN PROCEEDINGS 15TH IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE
, 2000
"... One important class of spatial database queries is the class of topological queries, i.e. queries invariant under homeomorphisms. We study topological queries expressible in the standard query language on spatial databases, firstorder logic with various amounts of arithmetic. Our main technical re ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
One important class of spatial database queries is the class of topological queries, i.e. queries invariant under homeomorphisms. We study topological queries expressible in the standard query language on spatial databases, firstorder logic with various amounts of arithmetic. Our main technical
EQLLite: Effective firstorder query processing in description logics
 In Proc. of IJCAI 2007
"... Querying Description Logic knowledge bases has received great attention in the last years. In such a problem, the need of coping with incomplete information is the distinguishing feature with respect to querying databases. Due to this feature, we have to deal with two conflicting needs: on the one h ..."
Abstract

Cited by 63 (37 self)
 Add to MetaCart
hand, we would like to query the knowledge base with sophisticated mechanisms provided by full firstorder logic (FOL); on the other hand, the presence of incomplete information makes query answering a much more difficult task than in databases. In this paper we advocate the use of a nonmonotonic
FirstOrder Queries over Temporal Databases Inexpressible in Temporal Logic
, 1996
"... . Queries over temporal databases involve references to time. We study differences between two approaches of including such references into a firstorder query language (e.g., relational calculus): explicit (using typed variables and quantifiers) vs. implicit (using a finite set of modal connectives ..."
Abstract

Cited by 26 (14 self)
 Add to MetaCart
the expressive power of firstorder temporal logic. A consequence of this result is that there is no firstorder complete query language subqueryclosed with respect to a uniform database schema, and thus we cannot use temporal relational algebra over uniform relations to evaluate all firstorder definable
Distributed First Order Logics
, 1998
"... ist and Wiksell, Stockholm, 1965. [ Serafini and Ghidini, 1997 ] L. Serafini and C. Ghidini. Context Based Semantics for Federated Databases. In Proceedings of the 1st International and Interdisciplinary Conference on Modeling and Using Context (CONTEXT97), pages 3345, Rio de Jeneiro, Brazil, 199 ..."
Abstract

Cited by 70 (21 self)
 Add to MetaCart
ist and Wiksell, Stockholm, 1965. [ Serafini and Ghidini, 1997 ] L. Serafini and C. Ghidini. Context Based Semantics for Federated Databases. In Proceedings of the 1st International and Interdisciplinary Conference on Modeling and Using Context (CONTEXT97), pages 3345, Rio de Jeneiro, Brazil
Temporal versus FirstOrder Logic to Query Temporal Databases
 IN PROC. ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS (PODS'96
, 1996
"... A database history can be modeled as a (finite) sequence of instances discretely ordered by time. Similarly, the behavior of a system such as an operating system or a reactive system can be modeled by an infinite such sequence. One can view the sequence as one single database where each relation has ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
in temporal logic. It is known that these two approaches yield the same expressive power in the propositional case. Their comparison in the predicate/database context remained open. We prove here that there are firstorder logic queries on the timestamp representation that are not expressible in (extended
Decidability of FirstOrder Logic Queries over Views
, 1999
"... . We study the problem of deciding satisfiability of first order logic queries over views, our aim being to delimit the boundary between the decidable and the undecidable fragments of this language. Views currently occupy a central place in database research, due to their role in applications such a ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
. We study the problem of deciding satisfiability of first order logic queries over views, our aim being to delimit the boundary between the decidable and the undecidable fragments of this language. Views currently occupy a central place in database research, due to their role in applications
Results 1  10
of
638