Titlebook: Applications of Declarative Programming and Knowledge Management; 17th International C Dietmar Seipel,Michael Hanus,Armin Wolf Conference p

摘要記錄

Integrating Temporal Annotations in a Modular Logic Languageeover, in those examples, time and modularity are considered orthogonal to each other. In this paper we propose the addition of temporal annotations to a modular extension of LP such that the usage of a module is influenced by temporal conditions. Besides illustrative examples we also provide an ope

裙帶關(guān)系

harmony

Narrowing for First Order Functional Logic Programs with Call-Time Choice Semanticsaring of computed values. In this way, .-rewriting reflects the call-time choice semantics for non-determinism adopted by modern functional logic languages, where programs are rewrite systems possibly non-confluent and non-terminating. In this paper we extend that work providing a notion of .-narrow

TRACE

Type Unification with Wildcardsex types can arise. The term...is for example a correct type in ...In this paper we present a type unification algorithm for . type terms. The algorithm unifies type terms, which are in subtype relationship. For this we define . type terms and its subtyping relation, formally..As . allows wildcards

obsession

sacrum

carotenoids

ALIEN

accomplishment

Encoding of Planning Problems and Their Optimizations in Linear Logic in linear logic. This paper shows how planning problems can be encoded in Linear Logic and how some optimizations of planning problems can be encoded. These optimizations can help planners to improve the efficiency of finding solutions (plans).

HAWK

Relational Models for Tabling Logic Programs in a Database the database, rather than performing a complete re-computation. To validate this approach, we have extended the YapTab tabling system, providing engine support for exporting and importing tables to and from the MySQL RDBMS. Three different relational models for data storage and two recordset retrieval strategies are compared.