Results 11  20
of
1,699
Recursion on nested datatypes in dependent type theory
 Logic and Theory of Algorithms. Volume 5028 of Lecture Notes in Computer Science
, 2008
"... Abstract. Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent variable binding or to maintain certain invariants through typing. In dependent type theory, a major concern ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent variable binding or to maintain certain invariants through typing. In dependent type theory, a major
Nested Sketches
"... this paper is, to find a functorial model theory for those classes of algebras that appear naturally as semantics of algebraic specifications of parameterized data types, using initial respectively more general free functor semantics, and to extend the functorial model theory to specifications that ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
that use as well inductively defined data types as coinductively defined patterns of behavior and their systematic combinations
A framework for sequential planning in multiagent settings
 JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
, 2005
"... This paper extends the framework of partially observable Markov decision processes (POMDPs) to multiagent settings by incorporating the notion of agent models into the state space. Agents maintain beliefs over physical states of the environment and over models of other agents, and they use Bayesian ..."
Abstract

Cited by 130 (33 self)
 Add to MetaCart
to interactive settings which uses Nash equilibria as a solution paradigm. We seek to avoid some of the drawbacks of equilibria which may be nonunique and are not able to capture offequilibrium behaviors. We do so at the cost of having to represent, process and continually revise models of other agents. Since
Representing Inductive Inference with SOLDResolution
 Proc.IJCAI97 Workshop on Abduction and Induction in AI
, 1997
"... In this paper we discuss how to use SOLresolution, proposed by Inoue, for inductive inference. In order to use some results on Horn clause logic, we define a new inference method SOLDresolution. SOLDresolution is obtained by adding the skipping rule to SLDresolution, and is also regarded as a spe ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
special type of SOLresolution. When we use SOLDresolution to hypothesis finding, every derived hypothesis is a negation of a clause, while in induction it must be a clause. We give two solutions to the problem. The first solution is to use inverse entailment proposed by Muggleton. In order to give
Strongly Typed Inductive Concept Learning
 Proceedings of the 8th International Conference on Inductive Logic Programming, volume 1446 of Lecture Notes in Artificial Intelligence
, 1998
"... . In this paper we argue that the use of a language with a type system, together with higherorder facilities and functions, provides a suitable basis for knowledge representation in inductive concept learning and, in particular, illuminates the relationship between attributevalue learning and indu ..."
Abstract

Cited by 31 (15 self)
 Add to MetaCart
. In this paper we argue that the use of a language with a type system, together with higherorder facilities and functions, provides a suitable basis for knowledge representation in inductive concept learning and, in particular, illuminates the relationship between attributevalue learning
Letter recognition using hollandstyle adaptive classifiers
 Machine Learning
, 1991
"... Abstract. Machine rule induction was examined on a difficult categorization problem by applying a Hollandstyle classifier system to a complex letter ecognition task. A set of 20,000 unique letter images was generated by randomly distorting pixel images of the 26 uppercase l tters from 20 different ..."
Abstract

Cited by 98 (0 self)
 Add to MetaCart
commercial fonts. The parent fonts represented a full range of character types including script, italic, serif, and Gothic. The features of each of the 20,000 characters were summarized in terms of 16 primitive numerical attributes. Our research focused on machine induction techniques for generating IF
Positive Nested Conceptual Graphs
 Proc. 5th Int’l Conf. on Conceptual Structures (ICCS 97), Springer Verlag, LNAI 1257
"... . This paper deals with positive (i.e. without negation) nested conceptual graphs (NCGs). We first give a general framework  graphs of graphs provided with morphism  for defining classes of NCGs. Then we define a new class of NCGs  typed NCGs  and we show that known kinds of NCGs can be desc ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
. This paper deals with positive (i.e. without negation) nested conceptual graphs (NCGs). We first give a general framework  graphs of graphs provided with morphism  for defining classes of NCGs. Then we define a new class of NCGs  typed NCGs  and we show that known kinds of NCGs can
Reasoning about Nested Functional Dependencies
"... Functional dependencies add semantics to a database schema, and are useful for studying various problems, such as database design, query optimization and how dependencies are carried into a view. In the context of a nested relational model, these dependencies can be extended by using path expression ..."
Abstract

Cited by 34 (3 self)
 Add to MetaCart
Functional dependencies add semantics to a database schema, and are useful for studying various problems, such as database design, query optimization and how dependencies are carried into a view. In the context of a nested relational model, these dependencies can be extended by using path
Representations of stream processors using nested fixed points
 Logical Methods in Computer Science
"... Abstract. We define representations of continuous functions on infinite streams of discrete values, both in the case of discretevalued functions, and in the case of streamvalued functions. We define also an operation on the representations of two continuous functions between streams that yields a ..."
Abstract

Cited by 24 (2 self)
 Add to MetaCart
representation of their composite. In the case of discretevalued functions, the representatives are wellfounded (finitepath) trees of a certain kind. The underlying idea can be traced back to Brouwer’s justification of barinduction, or to Kreisel and Troelstra’s elimination of choicesequences. In the case
The Design of a Prettyprinting Library
 Advanced Functional Programming
, 1995
"... Layouts We'll begin by looking for an abstract model of a prettyprinter's output  that is, prettily indented text. We could say that the output is just a string, but a string has so little structure that we can derive no intuition from it. Let us say instead, that a layout is a sequenc ..."
Abstract

Cited by 100 (2 self)
 Add to MetaCart
empty (we use [\Gamma] + for the type of nonempty lists). We'll return to this point below. We can now specify text, nest and ($$) very easily: text s = [(0; s)] nest k l = [(i + k; s)j(i; s) / l] l 1 $$ l 2 = l 1 ++l 2 The right definition of horizontal composition (!?) is not so obvious. The desired
Results 11  20
of
1,699