Results 1  10
of
132,707
An Analysis of FirstOrder Logics of Probability
 Artificial Intelligence
, 1990
"... : We consider two approaches to giving semantics to firstorder logics of probability. The first approach puts a probability on the domain, and is appropriate for giving semantics to formulas involving statistical information such as "The probability that a randomly chosen bird flies is greater ..."
Abstract

Cited by 314 (17 self)
 Add to MetaCart
: We consider two approaches to giving semantics to firstorder logics of probability. The first approach puts a probability on the domain, and is appropriate for giving semantics to formulas involving statistical information such as "The probability that a randomly chosen bird flies
Taming FirstOrder Logic
, 1998
"... In this paper we define computationally wellbehaved versions of classical firstorder logic and prove that the validity problem is decidable. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper we define computationally wellbehaved versions of classical firstorder logic and prove that the validity problem is decidable.
The emergence of firstorder logic
 University of Minnesota Press, Minneapolis
, 1988
"... To most mathematical logicians working in the 1980s, firstorder logic is the proper and natural framework for mathematics. Yet it was not always so. In 1923, when a young Norwegian mathematician named Thoralf Skolem argued that set theory should be based on firstorder logic, it was ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
To most mathematical logicians working in the 1980s, firstorder logic is the proper and natural framework for mathematics. Yet it was not always so. In 1923, when a young Norwegian mathematician named Thoralf Skolem argued that set theory should be based on firstorder logic, it was
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
FirstOrder Logic of Proofs
, 2011
"... The propositional logic of proofs LP revealed an explicit provability reading of modal logic S4 which provided an indented provability semantics for the propositional intuitionistic logic IPC and led to a new area, Justification Logic. In this paper, we find the firstorder logic of proofs FOLP capa ..."
Abstract

Cited by 28 (12 self)
 Add to MetaCart
The propositional logic of proofs LP revealed an explicit provability reading of modal logic S4 which provided an indented provability semantics for the propositional intuitionistic logic IPC and led to a new area, Justification Logic. In this paper, we find the firstorder logic of proofs FOLP
Extended firstorder logic
, 2009
"... We consider the EFO fragment of simple type theory, which restricts quantification and equality to base types but retains lambda abstractions and higherorder variables. We show that this fragment enjoys the characteristic properties of firstorder logic: complete proof systems, compactness, and c ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We consider the EFO fragment of simple type theory, which restricts quantification and equality to base types but retains lambda abstractions and higherorder variables. We show that this fragment enjoys the characteristic properties of firstorder logic: complete proof systems, compactness
First Order Logic
"... st order logic can still be adequate programming languages. Mathematicians have used first order logic as a programming language in which to encode all the known acceptable principles of mathematical inference. The result is axiomatic set theory. Any mathematical proof can, in principle, be expresse ..."
Abstract
 Add to MetaCart
st order logic can still be adequate programming languages. Mathematicians have used first order logic as a programming language in which to encode all the known acceptable principles of mathematical inference. The result is axiomatic set theory. Any mathematical proof can, in principle
First Order Logic
, 1992
"... er logic can still be adequate programming languages. Mathematicians have used first order logic as a programming language in which to encode all the known acceptable principles of mathematical inference. The result is axiomatic set theory. Any mathematical proof can, in principle, be expressed as a ..."
Abstract
 Add to MetaCart
er logic can still be adequate programming languages. Mathematicians have used first order logic as a programming language in which to encode all the known acceptable principles of mathematical inference. The result is axiomatic set theory. Any mathematical proof can, in principle, be expressed
First Order Logical Filtering
"... Logical filtering is the process of updating a belief state (set of possible world states) after a sequence of executed actions and perceived observations. In general, it is intractable in dynamic domains that include many objects and relationships. Still, potential applications for such domains (e. ..."
Abstract
 Add to MetaCart
.g., semantic web, autonomous agents, and partialknowledge games) encourage research beyond immediate intractability results. In this paper we present polynomialtime algorithms for filtering belief states that are encoded as FirstOrder Logic (FOL) formulae. We sidestep previous discouraging results, and show
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, 1997. Also IRSTTechnical Report 960902, IRST, Trento, Italy. [ Subrahmanian, 1994 ] V.S. Subrahmanian. Amalgamating Knowledge Bases. ACM Trans. Database Syst., 19(2):291331, 1994. [ Wiederhold, 1992 ] G. Wiederhold. Mediators in the architecture of future information systems. IEEE Computer, 25(3):3849, 1992. and complete calculus for DFOL based on ML systems. Finally we have compared our formalism with other formalisms for the representation and integration of distributed knowledge and reasoning systems. Acknowledgments. We thank all the people of the Mechanized Reasoning Group of IRST and DISA for useful discussions and feedb
Results 1  10
of
132,707