Sciweavers

2905 search results - page 91 / 581
» Formal Memetic Algorithms
Sort
View
MLG
2007
Springer
14 years 3 months ago
Graphs, Hypergraphs, and Inductive Logic Programming
Abstract. There are many connections between graph mining and inductive logic programming (ILP), or more generally relational learning. Up till now these connections have mostly be...
Hendrik Blockeel, Tijn Witsenburg, Joost N. Kok
FM
2003
Springer
96views Formal Methods» more  FM 2003»
14 years 2 months ago
Event Based Sequential Program Development: Application to Constructing a Pointer Program
In this article, I present an “event approach” used to formally develop sequential programs. It is based on the formalism of Action Systems [6] (and Guarded Commands[7]), which...
Jean-Raymond Abrial
ICGI
1998
Springer
14 years 1 months ago
Meaning Helps Learning Syntax
In this paper, we propose a new framework for the computational learning of formal grammars with positive data. In this model, both syntactic and semantic information are taken int...
Isabelle Tellier
ATAL
2007
Springer
14 years 28 days ago
Planning and defeasible reasoning
We present an argumentation-based formalism that an agent could use for constructing plans. We will analyze the interaction of arguments and actions when they are combined to cons...
Diego R. García, Alejandro Javier Garc&iacu...
ACL
1990
13 years 10 months ago
Structural Disambiguation with Constraint Propagation
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
Hiroshi Maruyama