Results 1  10
of
837,114
An ordersorted resolution with implicitly negative sorts
 In Proceedings of the 2001 Int. Conf. on Logic Programming
, 2001
"... Abstract. We usually use natural language vocabulary for sort names in ordersorted logics, and some sort names may contradict other sort names in the sorthierarchy. These implicit negations, called lexical negations in linguistics, are not explicitly prefixed by the negation connective. In this pa ..."
Abstract

Cited by 12 (10 self)
 Add to MetaCart
Abstract. We usually use natural language vocabulary for sort names in ordersorted logics, and some sort names may contradict other sort names in the sorthierarchy. These implicit negations, called lexical negations in linguistics, are not explicitly prefixed by the negation connective
Ordersorted polymorphism in isabelle
 Logical Environments
, 1993
"... MLstyle polymorphism can be generalized from a singlesorted algebra of types to an ordersorted one by adding a partially ordered layer of “sorts ” on top of the types. Type inference proceeds as in the Hindley/Milner system, except that ordersorted unification of types is used. The resulting sys ..."
Abstract

Cited by 37 (2 self)
 Add to MetaCart
MLstyle polymorphism can be generalized from a singlesorted algebra of types to an ordersorted one by adding a partially ordered layer of “sorts ” on top of the types. Type inference proceeds as in the Hindley/Milner system, except that ordersorted unification of types is used. The resulting
HigherOrder OrderSorted Resolution
 FB Informatik, Universitat des Saarlandes
, 1994
"... The introduction of sorts to firstorder automated deduction has brought greater conciseness of representation and a considerable gain in efficiency by reducing the search space. It is therefore promising to treat sorts in higher order theorem proving as well. In this paper we present a generalizati ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
generalization of Huet's Constrained Resolution to an ordersorted type theory \SigmaT with term declarations. This system builds certain taxonomic axioms into the unification and conducts reasoning with them in a controlled way. We make this notion precise by giving a relativization operator that totally
OrderSorted Polymorphism in Isabelle \Lambda
, 1992
"... Abstract MLstyle polymorphism can be generalized from a singlesorted algebra of types to an ordersorted one by adding a partially ordered layer of "sorts " on top of the types. Type inference proceeds as in the Hindley/Milner system, except that ordersorted unification of types ..."
Abstract
 Add to MetaCart
Abstract MLstyle polymorphism can be generalized from a singlesorted algebra of types to an ordersorted one by adding a partially ordered layer of "sorts " on top of the types. Type inference proceeds as in the Hindley/Milner system, except that ordersorted unification
Logic Programming over Polymorphically OrderSorted Types
, 1989
"... This thesis presents the foundations for relational logic programming over polymorphically ordersorted data types. This type discipline combines the notion of parametric polymorphism, which has been developed for higherorder functional programming, with the notion of ordersorted typing, which ha ..."
Abstract

Cited by 59 (0 self)
 Add to MetaCart
This thesis presents the foundations for relational logic programming over polymorphically ordersorted data types. This type discipline combines the notion of parametric polymorphism, which has been developed for higherorder functional programming, with the notion of ordersorted typing, which
Colimits of OrderSorted Specifications
 In Recent Trends in Algebraic Development Techniques, Proc. 12th International Workshop, WADT '97
"... . We prove cocompleteness of the category of CASL signatures, of monotone signatures, of strongly regular signatures and of strongly locally filtered signatures. This shows that using these signature categories is compatible with a pushout or colimit based module system. 1 Introduction "Given ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
"Putting theories together to make specifications" [3]. That is, specifications should be developed in a modular way, using colimits to combine different modules properly. An orthogonal question is that of the logic that is used to specify the individual modules. Ordersorted algebra is a
Entailment and Disentailment of OrderSorted Feature Constraints
 In Proceedings of the Fourth International Conferenceon Logic Programmingand Automated Reasoning, Andrei Voronkov
, 1993
"... LIFE uses matching on ordersorted feature structures for passing arguments to functions. As opposed to unication which amounts to normalizing a conjunction of constraints, solving a matching problem consists of deciding whether a constraint (guard) or its negation are entailed by the context. We gi ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
LIFE uses matching on ordersorted feature structures for passing arguments to functions. As opposed to unication which amounts to normalizing a conjunction of constraints, solving a matching problem consists of deciding whether a constraint (guard) or its negation are entailed by the context. We
Abstract OrderSorted Logic Programming with Predicate Hierarchy
"... Ordersorted logic has been formalized as firstorder logic with sorted terms where sorts are ordered to build a hierarchy (called a sorthierarchy). These sorted logics lead to useful expressions and inference methods for structural knowledge that ordinary firstorder logic lacks. Nitta et al. poin ..."
Abstract
 Add to MetaCart
Ordersorted logic has been formalized as firstorder logic with sorted terms where sorts are ordered to build a hierarchy (called a sorthierarchy). These sorted logics lead to useful expressions and inference methods for structural knowledge that ordinary firstorder logic lacks. Nitta et al
Sorting networks and their applications
, 1968
"... To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing ..."
Abstract

Cited by 660 (0 self)
 Add to MetaCart
To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing
Description Logic vs. OrderSorted Feature Logic
"... Abstract. We compare and contrast Description Logic (DL) and OrderSorted Feature (OSF) Logic from the perspective of using them for expressing and reasoning with knowledge structures of the kind used for the Semantic Web. ..."
Abstract
 Add to MetaCart
Abstract. We compare and contrast Description Logic (DL) and OrderSorted Feature (OSF) Logic from the perspective of using them for expressing and reasoning with knowledge structures of the kind used for the Semantic Web.
Results 1  10
of
837,114