It is widely accepted that many algorithms can be concisely and clearly expressed as logical inference rules. However, logicprogramming has been inappropriate for the study of the running time of algorithms because t...
详细信息
ISBN:
(纸本)3540439307
It is widely accepted that many algorithms can be concisely and clearly expressed as logical inference rules. However, logicprogramming has been inappropriate for the study of the running time of algorithms because there has not been a clear and precise model of the run time of a logic program. We present a logicprogramming model of computation appropriate for the study of the run time of a wide variety of algorithms.
A neural implementation which provides an interesting massively parallel model for computing a fixed-point semantics of a program is introduced for multiadjoint logicprogramming [3]. Distinctive features of this prog...
ISBN:
(纸本)3540439307
A neural implementation which provides an interesting massively parallel model for computing a fixed-point semantics of a program is introduced for multiadjoint logicprogramming [3]. Distinctive features of this programming paradigm are that: very general aggregation connectives in the bodies are allowed; by considering different adjoint pairs, it is possible to use several implications in the rules.
Current trends in Software Engineering and developments in logicprogramming lead us to believe that there will be an opportunity for logicprogramming to make a breakthrough in Software Engineering. In this paper, we...
详细信息
ISBN:
(纸本)3540439307
Current trends in Software Engineering and developments in logicprogramming lead us to believe that there will be an opportunity for logicprogramming to make a breakthrough in Software Engineering. In this paper, we explain how this has arisen, and justify our belief with a real-life application. Above all, we invite fellow workers to take up the challenge that the opportunity offers.
We provide here a declarative and model-theoretic characterization of the approximations computed by consistency during the resolution of finite domain constraint satisfaction problems.
ISBN:
(纸本)3540439307
We provide here a declarative and model-theoretic characterization of the approximations computed by consistency during the resolution of finite domain constraint satisfaction problems.
this paper presents an application of higher-order logicprogramming: program schemata and schema-based transformations of logic programs. We are constructing higher-order programs that can unify logic programs with s...
ISBN:
(纸本)3540439307
this paper presents an application of higher-order logicprogramming: program schemata and schema-based transformations of logic programs. We are constructing higher-order programs that can unify logic programs with suitable program schemata, which are also higher-order constructs. they are abstracting out common recursive control flow patterns, and we can think about logic programs as about instances of certain program schemata. We use λProlog, because it can serve both as the language of logic programs and as the meta-language of program schemata.
Higher-order logicprogramming languages such as Elf extend first-order logicprogramming in two ways: first-order terms axe replaced with (dependently) typed A-terms and the body of clauses may contain implication an...
详细信息
ISBN:
(纸本)3540439307
Higher-order logicprogramming languages such as Elf extend first-order logicprogramming 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 logicprogramming 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 logicprogramming interpreter for Elf.
In this experience paper we present a case study in using logicprogramming in a pervasive computing project in the healthcare domain. An expert system is used to detect healthcare activities in a pervasive hospital e...
详细信息
ISBN:
(纸本)3540439307
In this experience paper we present a case study in using logicprogramming in a pervasive computing project in the healthcare domain. An expert system is used to detect healthcare activities in a pervasive hospital environment where positions of people and things are tracked. Based on detected activities an activity-driven computing infrastructure provides computational assistance to healthcare staff on mobile- and pervasive computing equipment. Assistance range from simple activities like fast log-in into the electronic patient medical record system to complex activities like signing for medicine given to specific patients. We describe the role of logicprogramming in the infrastructure and discuss the benefits and problems of using logicprogramming in a pervasive context.
the growing importance of XML a's a data interchange standard demands languages for data querying and transformation. Since the mid 90es, several such languages have been proposed that axe inspired from functional...
详细信息
ISBN:
(纸本)3540439307
the growing importance of XML a's a data interchange standard demands languages for data querying and transformation. Since the mid 90es, several such languages have been proposed that axe inspired from functional languages (such as XSLT [1]) and/or database query languages (such as XQuery [2]). this paper addresses applying logicprogramming concepts and techniques to designing a declarative, rule-based query and transformation language for XML and semistructured data. the paper first introduces issues specific to XML and semistructured data such as the necessity of flexible "query terms" and of "construct terms". then, it is argued that logicprogramming concepts are particularly appropriate for a declaxative query and transformation language for XML and semistructured data. Finally, a new form of unification, called "simulation unification", is proposed for answering "query terms", and it is illustrated on examples.
We show how logic programs may be used to protect deductive databases from the unauthorized retrieval of positive and negative information, and from unauthorized insert and delete requests. To achieve this protection,...
详细信息
ISBN:
(纸本)3540439307
We show how logic programs may be used to protect deductive databases from the unauthorized retrieval of positive and negative information, and from unauthorized insert and delete requests. To achieve this protection, a deductive database is expressed in a form that is guaranteed to permit only authorized access requests to be performed. the protection of the positive information that may be retrieved from a database and the information that may be inserted are treated in a uniform way as is the protection of the negative information in the database, and the information that may be deleted.
this paper presents two proof systems for the equivalence of programs. the language concerned is CLP to which the universal quantifier is added (CLPV). Both systems, axe based on first order classical logic. the first...
详细信息
ISBN:
(纸本)3540439307
this paper presents two proof systems for the equivalence of programs. the language concerned is CLP to which the universal quantifier is added (CLPV). Both systems, axe based on first order classical logic. the first uses an induction rule and allows one to prove that the set of finite successes of a program is included in another program's corresponding set. the second uses a coinduction rule for proving the inclusion of the sets of infinite successes which contain the finite successes. Finally we show that the proof systems axe equivalent under some natural conditions.
暂无评论