the family of concurrent logicprogramming languages has proved to be a great asset to programmers seeking to quickly construct efficient programs for highly parallel shared-memory machines. If these languages are to ...
详细信息
ISBN:
(纸本)3540569448
the family of concurrent logicprogramming languages has proved to be a great asset to programmers seeking to quickly construct efficient programs for highly parallel shared-memory machines. If these languages are to be implemented efficiently for other architectures, however, language-specific compile-time analysis techniques must be improved. this work describes a technique and implementation df ''sequentialization'' (compile-time ordering of body goals) based on automatic ''mode analysis'' (identification of input and output parameters) for a large subset of concurrent logic programs: feedback-free, fully-moded, flat-guarded programs. We present preliminary performance results from an FGHC-to-C compiler, utilizing these techniques, which produces very fast code.
A general framework for revision of nonmonotonic theories is presented. this framework can be applied if the intended nonmonotonic semantics is not (weakly) cumulative. For weaker-semantics, it is shown that revision ...
详细信息
ISBN:
(纸本)3540632557
A general framework for revision of nonmonotonic theories is presented. this framework can be applied if the intended nonmonotonic semantics is not (weakly) cumulative. For weaker-semantics, it is shown that revision by contraction is not possible whenever the intended semantics satisfies Weak Cut and revision by expansion fails whenever Weak (Cautious) Monotony fails. Furthermore, it turns out that revision by expansion can be used to test whether the framework can be applied successfully and we analyse the case for logicprogramming.
the proceedings contain 29 papers. the special focus in this conference is on Database theory. the topics include: Combinatorial and algebraic results for database relations;semantics of disjunctive deductive database...
ISBN:
(纸本)9783540560395
the proceedings contain 29 papers. the special focus in this conference is on Database theory. the topics include: Combinatorial and algebraic results for database relations;semantics of disjunctive deductive databases;on the composition and decomposition of attributes and tuples;approximate dependency inference from relations;views and decompositions of databases from a categorical perspective;computing with infinitary logic;query languages with counters;naturally embedded query languages;optimizing incremental computation of datalog programs with non-deterministic semantics;context-specific synchronization for atomic data types;hybrid atomicity for nested transactions;model and verification of a data manager based on ARIES;minimizing indefinite information in disjunctive deductive databases;well founded semantics and stable semantics of semi-strict programs;on finding extensions of default theories;incremental evaluation of datalog queries;decidability and undecidability of equivalence for linear datalog, with applications to normal-form optimizations;a paradox in database theory;a hierarchy of faithful set creation in pure OODB's;identification, genericity and consistency in object-oriented databases;subsumption for complex object data models;semantic information connected with data;declarative foundations of secure deductive databases;on materializing views and on-line queries;maintaining dictionaries: space-saving modifications of b-trees and set-term matching in logicprogramming.
In this paper we present an approach for learning and enhancing Pascal programming fluency through Game playing. this activity is intended to complement traditional teaching of concepts. the focus is on building progr...
详细信息
this paper presents an algebraic approach meant to provide an access to XML (Extensible Markup Language) components in the XML hierarchical trees. An adequate theoretical mechanism is critical for the creation of quer...
详细信息
ISBN:
(纸本)9781424438518
this paper presents an algebraic approach meant to provide an access to XML (Extensible Markup Language) components in the XML hierarchical trees. An adequate theoretical mechanism is critical for the creation of query languages that handle XML documents and is extremely important for the development and standardization of XML parsing process. the authors of this article propose an algebraic formalism for navigation over XML source text, based on linear algebra theory. In the paper are presented the advantages of this nontraditional approach. the idea is compared to existing higher-order logic formalisms. A main goal of this article is to provide several modern linear algebra tools for work on the XML documents through direct access to the nodes of XML trees. the authors deeply feel that (his direction of research is crucial to advance query languages design, development and their future embedding into practice.
Modern software engineering has cons:e to a point where it deals with quite large and complex software artifacts. Labor-intensive activities such as code analysis and code transformation are becoming less and less tra...
详细信息
ISBN:
(纸本)9781424426737
Modern software engineering has cons:e to a point where it deals with quite large and complex software artifacts. Labor-intensive activities such as code analysis and code transformation are becoming less and less tractable on such enormous software systems unless a certain level of automatization is provided. Since automatic approaches of code analysis and code transformation strongly rely on software models instead of actual software systems, the software modeling process is of vital interest to a great deal of researchers in the software engineering community. However, the main drawback of most of the software modeling tools available is the fact that they are aimed at software, systems written in a certain programming language. this article introduces ProGen, a software tool capable of modeling software systems written in any language for which a plain JAVACC grammar is available, also describing its advantages and limitations.
Multiset rewriting has proved to be a useful presentation of process synchronization [1, 2, 3, 6]. Since sequent calculus presentations of logics that do not use the structural rules of contractions and weakening are ...
详细信息
ISBN:
(纸本)9783540584315
Multiset rewriting has proved to be a useful presentation of process synchronization [1, 2, 3, 6]. Since sequent calculus presentations of logics that do not use the structural rules of contractions and weakening are based on using multisets of formulas as left and right contexts, it is natural to identify processes with formulas, multisets with sequent contexts, and multiset rewriting as an inference rule. Given earlier work on using sequent calculus to describe logicprogramming as goal-directed search for proofs [8], it is most natural to use right-hand contexts of sequents to represent multisets of processes. this choice requires the identification of the multiset constructor and the empty multiset withthe multiplicative disjunction and false (the and ⊥ of linear logic [4]), and backchaining with a single step of multiset rewriting. While the logicprogramming language λ Prolog [10] and its linear logic refinement Lolli [5] contain rich sources of abstraction (such as modular programming, abstract data types, and higher-order programming), they contain no primitives for specifying concurrency, communications, or synchronization. If multiset rewriting is added to Lolli via the logical connectives and ⊥, the result is a language that contains primitives for both abstraction and concurrency. Surprisingly, the resulting logic, called Forum [7], is a presentation of all of linear logic in the sense that all of the connectives of linear logic can be defined via logical equivalences using only the connectives of Forum. thus the rich meta-theory of linear logic, for example, the de Morgan dualities and cut-elimination, can be applied to the analysis of Forum programs. Several examples to illustrate the expressiveness of this presentation of linear logic will be given. these examples will involve a specification of sequent calculi for object-level logics, a specification of the π-calculus [9], and a specification of a functional programming language that contains side-e
Gene Expression programming (GEP) is a powerful evolutionary algorithm derived from Genetic Algorithm and Genetic programming. However, when dealing with complex problems, GEP shows quite slow convergence speed, it al...
详细信息
ISBN:
(纸本)9780769533049
Gene Expression programming (GEP) is a powerful evolutionary algorithm derived from Genetic Algorithm and Genetic programming. However, when dealing with complex problems, GEP shows quite slow convergence speed, it also probably encounters premature convergence. In this paper, Gene Expression-based Clonal Selection Algorithm (GE-CSA) was proposed to synthesize combinational logic circuit, which combines the advantages of Clonal Selection Algorithm (CSA) and GEP, overcoming some drawbacks of GEP. the circuit encoding of our proposed method is very simple and efficient. Using this method, circuits reaching design demand is automatically designed. Obtained circuits are quite compact. Two kinds of combinational logic circuit are synthesized to verify the effectiveness of our approach. the experimental results show that our proposed approach can automatically generate combinational logic circuit efficiently and effectively.
Limiting the number of times a variable appears in either the head or the body of a rule, we identify two classes of normal propositional logic programs. these classes have the desirable property that stable models, i...
详细信息
ISBN:
(纸本)3540632557
Limiting the number of times a variable appears in either the head or the body of a rule, we identify two classes of normal propositional logic programs. these classes have the desirable property that stable models, if they exist, can be found in linear time (worst case). We also identify a related class containing;programs for which the well-founded model can be acquired in linear time, yet for which computing the stable model(s) remains NP-complete. We show in this class how, by relaxing one constraint, previously linear complexity is increased to intractability.
this book constitutes the refereed proceedings of the 4thinternationalconference on algebraic Biology, ANB 2010, held at the Castle of Hagenberg, Austria in July/August 2010. the conference is a follow up of the AB ...
详细信息
ISBN:
(数字)9783642280672
ISBN:
(纸本)9783642280665
this book constitutes the refereed proceedings of the 4thinternationalconference on algebraic Biology, ANB 2010, held at the Castle of Hagenberg, Austria in July/August 2010. the conference is a follow up of the AB conference.
the 10 papers were carefully reviewed and selected from numerous submissions. the papers are organized in topical sections on mathematical modeling, system analysis and design, genomics, molecular structure analysis, automata theory, artificial intelligence, sequence analysis, automated reasoning, formal language and hybrid symbolic numerical methods.
暂无评论