Results 11  20
of
219
Stable Theories With a New Predicate
 J. Symbolic Logic
, 2000
"... Introduction Let M be an Lstructure and A be an infinite subset of M . Two structures can be defined from A: ffl The induced structure on A has a name R' for every ;definable relation '(M) " A n on A. Its language is L ind = fR' j ' = '(x 1 ; : : : ; xn ) an L ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
formulag: A with its L ind structure will be denoted by A ind . ffl The pair (M; A) is an L(P )structure, where P is a unary predicate for A and
Possible Worlds Semantics for Predicates
, 2002
"... We develop possible worlds semantics for as a predicate rather than as an operator of sentences. The unary predicate symbol is added to the language of arithmetic (or an extension thereof); this yields the language L . Every world in our possible worlds semantics is the standard model of arith ..."
Abstract
 Add to MetaCart
We develop possible worlds semantics for as a predicate rather than as an operator of sentences. The unary predicate symbol is added to the language of arithmetic (or an extension thereof); this yields the language L . Every world in our possible worlds semantics is the standard model
A Probabilistic Network of Predicates
 Stanford University
, 1992
"... Bayesian networks are directed acyclic graphs representing independence relationships among a set of random variables. A random variable can be regarded as a set of exhaustive and mutually exclusive propositions. We argue that there are several drawbacks resulting from the propositional nature and a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
and acyclic structure of Bayesian networks. To remedy these shortcomings, we propose a probabilistic network where nodes represent unary predicates and which may contain directed cycles. The proposed representation allows us to represent domain knowledge in a single static network even though we cannot
The Utility of Knowledge in Inductive Learning
, 1992
"... In this paper, we demonstrate how different forms of background knowledge can be integrated with an inductive method for generating constantfree Horn clause rules. Furthermore, we evaluate, both theoretically and empirically, the effect that these types of knowledge have on the cost of learning a r ..."
Abstract

Cited by 154 (22 self)
 Add to MetaCart
language to that of propositional calculus, by only allowing unary predicates (Hirsh, 1989;...
The completeness of logic programming with sort predicates
 Systems and Computers in Japan 35(1):37–46
, 2004
"... An ordersorted logic can be regarded as a generalized firstorder predicate logic that includes many and ordered sorts (i.e. a sorthierarchy). In the fields of knowledge representation and AI, this logic with sorthierarchy has been used to design a logicbased language appropriate for representin ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
knowledge and assertional knowledge. Namely, its language allows us to make use of sorts to denote not only the types of terms but also unary predicates (called sort predicates). In this paper, we propose a sorted logic programming language with sort predicates in order to improve the practicability
FirstOrder Queries over One Unary Function
"... This paper investigates the complexity of query problem for firstorder formulas on quasiunary signatures, that is, on vocabularies made of a single unary function and any number of monadic predicates. We first prove a form of quantifier elimination result: any query defined by a quasiunary first ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
This paper investigates the complexity of query problem for firstorder formulas on quasiunary signatures, that is, on vocabularies made of a single unary function and any number of monadic predicates. We first prove a form of quantifier elimination result: any query defined by a quasiunary first
FirstOrder Queries over One Unary Function
"... Abstract. This paper investigates the complexity of query problem for firstorder formulas on quasiunary signatures, that is, on vocabularies made of a single unary function and any number of monadic predicates. We first prove a form of quantifier elimination result: any query defined by a quasiun ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. This paper investigates the complexity of query problem for firstorder formulas on quasiunary signatures, that is, on vocabularies made of a single unary function and any number of monadic predicates. We first prove a form of quantifier elimination result: any query defined by a quasiunary
An ontology of metalevel categories
 Principles of Knowledge Representation and Reasoning: Proceedings of the Fourth International Conference (KR94
, 1994
"... We focus in this paper on some metalevel ontological distinctions among unary predicates, like those between concepts and assertional properties. Three are the main contributions of this work, mostly based on a revisitation of philosophical (and linguistic) literature in the perspective of knowledg ..."
Abstract

Cited by 81 (19 self)
 Add to MetaCart
We focus in this paper on some metalevel ontological distinctions among unary predicates, like those between concepts and assertional properties. Three are the main contributions of this work, mostly based on a revisitation of philosophical (and linguistic) literature in the perspective
Undecidable Theories In Stationary Logic
, 1982
"... It is shown that the theories of the following classes become undecidable in stationary logic: Well orderings with one unary predicate, linear orderings, and Boolean algebras. This is done by interpreting the theory of symmetric reflexive graphs. ..."
Abstract
 Add to MetaCart
It is shown that the theories of the following classes become undecidable in stationary logic: Well orderings with one unary predicate, linear orderings, and Boolean algebras. This is done by interpreting the theory of symmetric reflexive graphs.
Function Domains and Fraenkel Operator
, 1990
"... this paper. In this paper A, B are non empty sets and X is a set. In this article we present several logical schemes. The scheme Fraenkel5' concerns a non empty set A; a unary functor F yielding a set, and two unary predicates P ; Q; and states that: ..."
Abstract

Cited by 22 (6 self)
 Add to MetaCart
this paper. In this paper A, B are non empty sets and X is a set. In this article we present several logical schemes. The scheme Fraenkel5' concerns a non empty set A; a unary functor F yielding a set, and two unary predicates P ; Q; and states that:
Results 11  20
of
219