Results 1  10
of
1,961,252
1 FirstOrder Theories
"... A firstorder theory T is a set of firstorder sentences that is closed under the entailment relation, so ϕ ∈ T Not yet just in case T � ϕ. We typically specify a theory by (i) listing its vocabulary and (ii) listing a set of axioms that entails all of the sentences in the theory or at least giving ..."
Abstract
 Add to MetaCart
A firstorder theory T is a set of firstorder sentences that is closed under the entailment relation, so ϕ ∈ T Not yet just in case T � ϕ. We typically specify a theory by (i) listing its vocabulary and (ii) listing a set of axioms that entails all of the sentences in the theory or at least giving
First Order Theory Refinement
, 1996
"... . This paper summarizes the current state of the art in the topics of firstorder theory revision and theory restructuring. The various tasks involved in firstorder theory refinement (revision vs. restructuring) are defined and then discussed in turn. For theory revision, the issue of minimality is ..."
Abstract

Cited by 33 (0 self)
 Add to MetaCart
. This paper summarizes the current state of the art in the topics of firstorder theory revision and theory restructuring. The various tasks involved in firstorder theory refinement (revision vs. restructuring) are defined and then discussed in turn. For theory revision, the issue of minimality
Gödel lecture: First order theories
"... A theme of this lecture is to give some justification for the thesis that stable theories are the logically perfect (first order) theories, or maybe rather the fundamental “tame ” (first order) theories: ◮ This is a variant on Zilber’s “thesis ” that categorical theories ..."
Abstract
 Add to MetaCart
A theme of this lecture is to give some justification for the thesis that stable theories are the logically perfect (first order) theories, or maybe rather the fundamental “tame ” (first order) theories: ◮ This is a variant on Zilber’s “thesis ” that categorical theories
Learning First Order Theories
 Proc of the ISMIS94, LNAI 869
, 1994
"... . In the last decade, many efforts have been devoted to the exploration of techniques for learning and refining first order theories, as the necessary step for applying machine learning methodologies to real world applications. In this paper, we present a new approach to the integration of inductive ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
. In the last decade, many efforts have been devoted to the exploration of techniques for learning and refining first order theories, as the necessary step for applying machine learning methodologies to real world applications. In this paper, we present a new approach to the integration
Extension of FirstOrder Theories into Trees
"... Abstract. We present in this paper an automatic way to combine any firstorder theory T with the theory of finite or infinite trees. First of all, we present a new class of theories that we call zeroinfinitedecomposable and show that every decomposable theory T accepts a decision procedure in the ..."
Abstract
 Add to MetaCart
Abstract. We present in this paper an automatic way to combine any firstorder theory T with the theory of finite or infinite trees. First of all, we present a new class of theories that we call zeroinfinitedecomposable and show that every decomposable theory T accepts a decision procedure
FirstOrder Theory Change Systems and their Dynamic Semantics
, 1995
"... Systems of firstorder theory change are motivated, developed, and shown to be strongly connected to revisable systems of dynamic semantics. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Systems of firstorder theory change are motivated, developed, and shown to be strongly connected to revisable systems of dynamic semantics.
Classifying Toposes for First Order Theories
 Annals of Pure and Applied Logic
, 1997
"... By a classifying topos for a firstorder theory T, we mean a topos E such that, for any topos F , models of T in F correspond exactly to open geometric morphisms F ! E . We show that not every (infinitary) firstorder theory has a classifying topos in this sense, but we characterize those which ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
By a classifying topos for a firstorder theory T, we mean a topos E such that, for any topos F , models of T in F correspond exactly to open geometric morphisms F ! E . We show that not every (infinitary) firstorder theory has a classifying topos in this sense, but we characterize those which
Translating FirstOrder Theories into Logic Programs
 PROCEEDINGS OF THE TWENTYSECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
"... This paper focuses on computing firstorder theories under either stable model semantics or circumscription. A reduction from firstorder theories to logic programs under stable model semantics over finite structures is proposed, and an embedding of circumscription into stable model semantics is als ..."
Abstract
 Add to MetaCart
This paper focuses on computing firstorder theories under either stable model semantics or circumscription. A reduction from firstorder theories to logic programs under stable model semantics over finite structures is proposed, and an embedding of circumscription into stable model semantics
Translating FirstOrder Theories into Logic Programs
"... This paper focuses on computing firstorder theories under either stable model semantics or circumscription. A reduction from firstorder theories to logic programs under stable model semantics over finite structures is proposed, and an embedding of circumscription into stable model semantics is a ..."
Abstract
 Add to MetaCart
This paper focuses on computing firstorder theories under either stable model semantics or circumscription. A reduction from firstorder theories to logic programs under stable model semantics over finite structures is proposed, and an embedding of circumscription into stable model semantics
Results 1  10
of
1,961,252