Results 1  10
of
138
Composing TypeChecked Programs (Extended Abstract)
, 1995
"... ) Ulrich Geske HansJoachim Goltz National Research Centre for Informatics and Information Technology GMDFIRST Berlin fgeske,goltzg@first.gmd.de Mario Lenz Department of Computer Science Humboldt University of Berlin lenz@first.gmd.de January 13, 1995 1 Introduction Debugging of type errors in ..."
Abstract
 Add to MetaCart
) Ulrich Geske HansJoachim Goltz National Research Centre for Informatics and Information Technology GMDFIRST Berlin fgeske,goltzg@first.gmd.de Mario Lenz Department of Computer Science Humboldt University of Berlin lenz@first.gmd.de January 13, 1995 1 Introduction Debugging of type errors
Using Logic Programming in Java Environment (Extended Abstract)
, 1998
"... ) Dmitri Boulanger Ulrich Geske GMDFIRST, Rudower Chaussee 5, 12489 Berlin, Germany email: fdmitri,geskeg@first.gmd.de Abstract Using the logic programming system Minerva, Java and DMBS Oracle for development of a GISoriented constraint database systems is discussed. The central topic is a possi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
) Dmitri Boulanger Ulrich Geske GMDFIRST, Rudower Chaussee 5, 12489 Berlin, Germany email: fdmitri,geskeg@first.gmd.de Abstract Using the logic programming system Minerva, Java and DMBS Oracle for development of a GISoriented constraint database systems is discussed. The central topic is a
Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles
, 1990
"... In Baader (1990a,1990b), we have considered different types of semantics for terminologicial cycles in the concept language FL0 which allows only conjunction of concepts and value restrictions. It turned out that greatest fixedpoint semantics (gfpsemantics) seems to be most appropriate for cycles ..."
Abstract

Cited by 132 (24 self)
 Add to MetaCart
In Baader (1990a,1990b), we have considered different types of semantics for terminologicial cycles in the concept language FL0 which allows only conjunction of concepts and value restrictions. It turned out that greatest fixedpoint semantics (gfpsemantics) seems to be most appropriate for cycles in this language. In the present paper we shall show that the concept defining facilities of FL0 with cyclic definitions and gfpsemantics can also be obtained in a different way. One may replace cycles by role definitions involving union, composition, and transitive closure of roles. This proposes a way of retaining, in an extended language, the pleasant features of gfpsemantics for FL0 with cyclic definitions without running into the troubles caused by cycles in larger languages. Starting with the language ALC of Schmidt Schauß
unknown title
"... Abstract Lists are, on the one hand, a useful modeling construct in logic programming because of theirnot predefined length, on the other hand the concatenation of lists by append(L1,L2,L3) is rather inefficient because it copies the list L1. To avoid the invocation of the append/3procedure analter ..."
Abstract
 Add to MetaCart
Abstract Lists are, on the one hand, a useful modeling construct in logic programming because of theirnot predefined length, on the other hand the concatenation of lists by append(L1,L2,L3) is rather inefficient because it copies the list L1. To avoid the invocation of the append/3procedure analternative possibility is the use of incomplete lists of the form [ el 1,... elk  Var], in which Vardescribes a remainder of the list not specified completely. If there is an assignment of a concrete list L for this variable in the program, it will results an efficient (physical) concatenation of thefirst list elements with L without copying the elements el 1,...elk. This physical concatenation doesnot consist in an (extralogically) replacing of a pointer (a memory address) but is a purely logical operation since the reference to the list L was already created by the specification in the program.From the mathematical point of view, the difference of the two lists [el
Advanced Techniques for Logic Program Specialisation
, 1997
"... ... is an automatic technique for program optimisation. The central idea is to specialise a given source program for a particular application domain. Program specialisation encompasses traditional compiler optimisation techniques, but uses more aggressive transformations, yielding both much greater ..."
Abstract

Cited by 27 (14 self)
 Add to MetaCart
... is an automatic technique for program optimisation. The central idea is to specialise a given source program for a particular application domain. Program specialisation encompasses traditional compiler optimisation techniques, but uses more aggressive transformations, yielding both much greater speedups and more difficulty in controlling the transformation process. Because of
Pricing Bermudan and American Options Using the FFT Method by Fang FANG
, 2006
"... During the whole period, from literature review, numerical implementation, to remedy seeking for discovered problems, and final thesis writing, the work was under supervision of Dr.Ir. Kees Oosterlee. Without his great help, the thesis work could never have been finished successfully. The work is pe ..."
Abstract
 Add to MetaCart
support and help of prof. Ulrich Ruede, it was not possible for me to focus on this thesis work in the Netherlands. My husband is the one who’s always standing by my side, with encouragement and
Structural Constraint Satisfaction
 PROCEEDINGS OF AAAI99 WORKSHOP ON CONFIGURATION
, 1999
"... Conventional constraint satisfaction problem (CSP) formulations are static. There is a given set of constraints and variables, and the structure of the constraint graph does not change. For a lot of search problems, though, it is not clear in advance what a solution's constraint graph will ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
Conventional constraint satisfaction problem (CSP) formulations are static. There is a given set of constraints and variables, and the structure of the constraint graph does not change. For a lot of search problems, though, it is not clear in advance what a solution's constraint graph will look like. To overcome these deficiencies, we introduce the concept of structural constraints, which are restrictions on admissible constraint graphs. The construction of constraint graphs is based on the concept of graph grammars. This allows us to formulate and solve structural constraint satisfaction problems (SCSPs), handling combinatorial search problems without explicitly giving the solution's structure.
Optimizing ConstraintIntensive Problems Using Early Projection
 In Proceedings of the JICSLP Conference, PosterSession
, 1996
"... Introduction In today's topdown CLP systems, generally no projection is done before the end of computation. An essential reason is that backtracking may take place and the projection would have to be undone. But sometimes it is known that no backtracking will occur for certain goals. In this ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Introduction In today's topdown CLP systems, generally no projection is done before the end of computation. An essential reason is that backtracking may take place and the projection would have to be undone. But sometimes it is known that no backtracking will occur for certain goals. In this case, an early projection can be desirable, as many variables could be deleted and the entire projection could be much faster. In CLP(!) [4], a usercontrolled projection can be obtained by assert/1. This is exploited by the following scheme: proj (input, ) : normal(input, output), assert(memo(relevant input/output)), fail. proj (input, output) : retract(memo(relevant input/output)). The remaining program has to use predicate proj/2 instead of normal/2 . The concept of early projection s
On Incremental Adaptation of CHR Derivations
 Journal of Applied Artificial Intelligence, Special issue on Constraint Handling Rules
, 2000
"... Constraint solving in dynamic environments requires an immediate adaptation of solutions of constraint satisfaction problems if these problems are changing. After any change, an adapted solution is preferred which is stable, i.e. as close as possible to the original solution. A wide range of increme ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
Constraint solving in dynamic environments requires an immediate adaptation of solutions of constraint satisfaction problems if these problems are changing. After any change, an adapted solution is preferred which is stable, i.e. as close as possible to the original solution. A wide range of incremental constraint solving methods for dynamic, especially finite domain, constraint satisfaction problems (DCSPs) are known which satisfy more or less this additional requirement. Adaptation of DCSPs after constraint additions is in general simple and successfully solved, while adaptation after arbitrary constraint deletions is not. Fr{\"u}hwirth's Constraint Handling Rules (CHRs), a highlevel language extension to implement constraint solvers, are no exception. A new incremental algorithm is presented which adapts an arbitrary CHR derivation after eliminations of constraints in the processed DCSPs. Thus, the existing solvers  there are several dozens  for various kinds of constraints are now applicable in dynamic environment.
Results 1  10
of
138