Higher-order logic programming languages such as Elf extend first-order logic programming in two ways: first-order terms axe replaced with (dependently) typed A-terms and the body of clauses may contain implication an...
详细信息
ISBN:
(数字)9783540456193
ISBN:
(纸本)3540439307
Higher-order logic programming languages such as Elf extend first-order logic programming in two ways: first-order terms axe replaced with (dependently) typed A-terms and the body of clauses may contain implication and universal quantification. In this paper, we describe tabled higher-order logic programming where some redundant computation is eliminated by memoizing sub-computation and re-using its result later. This work extends Tamaki and Sato's search strategy based on memoization to the higher-order setting. We give a proof-theoretic characterization of tabling based on uniform proofs and prove soundness of the resulting interpreter. Based on it, we have implemented a prototype of a tabled logic programming interpreter for Elf.
The ability to express "derived predicates" in the formalization of a planning domain is both practically and theoretically important. In this paper, we propose an approach to planning with derived predicate...
详细信息
The task of search for interesting relationships among data has been always an research focus in data mining. The overall performance of mining association rules is determined by the discover the large itemsets, i.e.,...
详细信息
ISBN:
(纸本)0889864810
The task of search for interesting relationships among data has been always an research focus in data mining. The overall performance of mining association rules is determined by the discover the large itemsets, i.e., the sets of itemsets that have their support above a pre-determined minimum support. The algorithms proposed for association rules show different approaches to generate all large itemsets (Apriori, AprioriTid, AprioriHibrido, DHP (Standing for Direct Hashing and Pruning), DIC(Dynamic Itemset Counting), Partition, y FP-tree). However, none of these algorithms is based on operators of the relational algebra and all they have been implemented on outside of databases engines. In this paper, an algorithm called EquipAsso is proposed. EquipAsso is an algorithm for the discovery the large itemsets based on two new operators of relational algebra: Associator and EquiKeep. These two operators facilitate the search of large itemsets and they allow the tightly-coupled integration of the algorithm with a relational database system, Associator y EquiKeep are implemented in the SQL SELECT clause as two new primitives Associator Range and EquiKeep On.
In this paper, we show how declarative rules, and declarative programming, are used to control a complex, heterogeneous system where rules from disparate sources must interoperate. We show how imperative codes can be ...
详细信息
ISBN:
(纸本)9781581139648
In this paper, we show how declarative rules, and declarative programming, are used to control a complex, heterogeneous system where rules from disparate sources must interoperate. We show how imperative codes can be automatically generated from declarative rules to bind with the resources in the execution environment. Our approach shows how declarative programming can be used to effectively compose disparate systems together. We apply our approach to the control and co-ordination of home devices. Copyright 2005 ACM.
In this paper, we introduce a discrete event control for Cat and Mouse example based on a paraconsistent logic program EVALPSN stable model computation. Predicting and avoiding control deadlock states are crucial prob...
详细信息
Intuitively, reflection is the feature that can represent and reason meta-level entities at the object level. In this paper, we use a reflective language to implement a local model checker and analyze the implementati...
详细信息
We describe the current capabilities of a system for rule-based programming which is being developed by us. The system is called ρLog and consists of a pattern matching system and a strategic programming system embed...
详细信息
Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative languages. We sketch the main aspects of Meta-S ...
详细信息
Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative languages. We sketch the main aspects of Meta-S including solver and language integration as well as its strategy definition framework for specifying solver cooperation and language evaluation strategies by means of an example.
Many critical application systems require reconfigurability in order to adapt under changing environment. To achieve system reconfigurability, it is possible to use adaptation mechanisms that are external to component...
详细信息
ISBN:
(纸本)0769523560
Many critical application systems require reconfigurability in order to adapt under changing environment. To achieve system reconfigurability, it is possible to use adaptation mechanisms that are external to components or to use parameterized components. This paper focuses on making components reconfigurable in terms of QoS tradeoffs. We propose a new component parameterization technique which can transform individual components to reconfigurable ones such that they can support various QoS tradeoffs to achieve overall system QoS requirements. The parameterized components can be used to develop both statically and dynamically reconfigurable systems. The proposed technique is rule based, which provides flexibility and extensibility to enhance and improve the technique. A tool set has been developed based on the proposed technique to achieve semi-automated component parameterization.
In this paper we show that the language of declarative logic programming (DLP) with answer sets and its extensions can be used to specify database evolution due to updates and active rules, and to verify correctness o...
详细信息
ISBN:
(纸本)0769515312
In this paper we show that the language of declarative logic programming (DLP) with answer sets and its extensions can be used to specify database evolution due to updates and active rules, and to verify correctness of active rules with respect to a specification described using temporal logic and aggregate operators. We classify the specification of active rules into four kind of constraints which can be expressed using a particular extension of DLP called Smodels. Smodels allows us to specify the evolution, to specify the constraints, and to enumerate all possible initial database states and initial updates. Together, these can be used to analyze all possible evolution paths of an active database system to verify if they satisfy a set of given constraints.
暂无评论