Results 1 - 10
of
1,789,390
Advanced Elementary Formal Systems
, 2001
"... An elementary formal system (EFS) is a logic program such as a Prolog program, for instance, that directly manipulates strings. Arikawa and his co-workers proposed elementary formal systems as a unifying framework for formal language learning. ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
An elementary formal system (EFS) is a logic program such as a Prolog program, for instance, that directly manipulates strings. Arikawa and his co-workers proposed elementary formal systems as a unifying framework for formal language learning.
Extending Elementary Formal Systems
"... An elementary formal system (EFS) is a logic program such as a Prolog program, for instance, that directly manipulates strings. ..."
Abstract
- Add to MetaCart
An elementary formal system (EFS) is a logic program such as a Prolog program, for instance, that directly manipulates strings.
Learning Elementary Formal Systems with Queries
, 2000
"... An elementary formal system (EFS , for short) is a kind of logic program which directly manipulates character strings. A number of researches have investigated the ability of EFS as an uniform framework for language learning in various learning models including model inference, inductive inferenc ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
An elementary formal system (EFS , for short) is a kind of logic program which directly manipulates character strings. A number of researches have investigated the ability of EFS as an uniform framework for language learning in various learning models including model inference, inductive
A Translation Procedure for Elementary Formal Systems
"... An elementary formal system ( $EFS $ , for short) [8] is suitable to generate various for-mal languages [3]. The EFS has been investigated from the various viewpoints $[4, 11] $. In particular, from the viewpoints of translations on formal languages, Sugimoto and Ishizaka $[9, 10] $ have pointed out ..."
Abstract
- Add to MetaCart
An elementary formal system ( $EFS $ , for short) [8] is suitable to generate various for-mal languages [3]. The EFS has been investigated from the various viewpoints $[4, 11] $. In particular, from the viewpoints of translations on formal languages, Sugimoto and Ishizaka $[9, 10] $ have pointed
Polynomial-time Learning of Elementary Formal Systems
- Theoretical Computer Science
, 2000
"... An elementary formal system (EFS) is a logic program con- sisting of definite clauses whose arguments have patterns instead of first-order terms. We investigate EFSs for polynomial-time PAC-learnability. A definite clause of an EFS is hereditary if every pattern in the body is a subword of a pat ..."
Abstract
-
Cited by 38 (8 self)
- Add to MetaCart
An elementary formal system (EFS) is a logic program con- sisting of definite clauses whose arguments have patterns instead of first-order terms. We investigate EFSs for polynomial-time PAC-learnability. A definite clause of an EFS is hereditary if every pattern in the body is a subword of a
Elementary formal systems, intrinsic complexity, and procrastination
- Information and Computation
, 1997
"... Recently, rich subclasses of elementary formal systems (EFS) have been shown to be identifiable in the limit from only positive data. Examples of these classes are Angluin’s pattern languages, unions of pattern languages by Wright and Shinohara, and classes of languages definable by length-bounded e ..."
Abstract
-
Cited by 12 (5 self)
- Add to MetaCart
Recently, rich subclasses of elementary formal systems (EFS) have been shown to be identifiable in the limit from only positive data. Examples of these classes are Angluin’s pattern languages, unions of pattern languages by Wright and Shinohara, and classes of languages definable by length
Statecharts: A Visual Formalism For Complex Systems
, 1987
"... We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discrete-event systems, such as multi-computer real-time systems, communication protocols and digital control units. Our diagrams, which we cal ..."
Abstract
-
Cited by 2683 (56 self)
- Add to MetaCart
We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discrete-event systems, such as multi-computer real-time systems, communication protocols and digital control units. Our diagrams, which we
Formal Ontology and Information Systems
, 1998
"... Research on ontology is becoming increasingly widespread in the computer science community, and its importance is being recognized in a multiplicity of research fields and application areas, including knowledge engineering, database design and integration, information retrieval and extraction. We sh ..."
Abstract
-
Cited by 878 (11 self)
- Add to MetaCart
shall use the generic term information systems, in its broadest sense, to collectively refer to these application perspectives. We argue in this paper that so-called ontologies present their own methodological and architectural peculiarities: on the methodological side, their main peculiarity
Better Schools Matter? Parental Valuation of Elementary Education,” Quarterly
- Journal of Economics
, 1999
"... The evaluation of numerous school reforms requires an understanding of the value of better schools. Given the difficulty of calculating the relationship between school quality and student outcomes, I turn to another method and use house prices to infer the value parents place on school quality. I lo ..."
Abstract
-
Cited by 486 (3 self)
- Add to MetaCart
look within school districts at houses located on attendance district boundaries; houses then differ only by the elementary school the child attends. I thereby effectively remove the variation in neighborhoods, taxes, and school spending. I �nd that parents are willing to pay 2.5 percent more for a 5
Results 1 - 10
of
1,789,390