Sciweavers

68 search results - page 3 / 14
» Extension of First-Order Theories into Trees
Sort
View
BIRTHDAY
2004
Springer
14 years 26 days ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
FLAIRS
2008
13 years 9 months ago
A First-Order Bayesian Tool for Probabilistic Ontologies
One of the major weaknesses of current research on the Semantic Web (SW) is the lack of proper means to represent and reason with uncertainty. A number of recent efforts from the ...
Paulo Cesar G. da Costa, Marcelo Ladeira, Rommel N...
CADE
1994
Springer
13 years 11 months ago
PROTEIN: A PROver with a Theory Extension INterface
Abstract. PROTEIN (PROver with a Theory Extension INterface) is a PTTPbased first order theorem prover over built-in theories. Besides various standardrefinements knownformodelelim...
Peter Baumgartner, Ulrich Furbach
CSL
2006
Springer
13 years 11 months ago
On Rational Trees
Rational graphs are a family of graphs defined using labelled rational transducers. Unlike automatic graphs (defined using synchronized transducers) the first order theory of these...
Arnaud Carayol, Christophe Morvan
AML
2005
53views more  AML 2005»
13 years 7 months ago
Models of set theory with definable ordinals
A DO model (here also referred to a Paris model) is a model M of set theory all of whose ordinals are first order definable in M. Jeffrey Paris (1973) initiated the study of DO mo...
Ali Enayat