the purpose of this work is to show necessary steps in development modern work and efficient web site for electronic commerce based on object oriented programming and use of transactions.
the purpose of this work is to show necessary steps in development modern work and efficient web site for electronic commerce based on object oriented programming and use of transactions.
Process diagnosis can be defined as the identification of the system's functional states. When a mathematical model is difficult or not possible to obtain (which is generally the case for complex chemical processe...
详细信息
this paper describes an implementation of a new IEC 61499 execution environment based on the generic cyclic execution model, outlined within the draft IEC 61499 Compliance Profile for Execution models. the proposed mo...
详细信息
ISBN:
(纸本)9781424437597
this paper describes an implementation of a new IEC 61499 execution environment based on the generic cyclic execution model, outlined within the draft IEC 61499 Compliance Profile for Execution models. the proposed model further adds more details to the generic cyclic model via an abstract implementation independent way.
the proceedings contain 21 papers. the special focus in this conference is on logic, functional-logicprogramming, Applications, Program Analysis, Rewriting and Semantics. the topics include: A brief survey of quantum...
ISBN:
(纸本)354021402X
the proceedings contain 21 papers. the special focus in this conference is on logic, functional-logicprogramming, Applications, Program Analysis, Rewriting and Semantics. the topics include: A brief survey of quantum programming languages;analysis of synchronous and asynchronous cellular automata using abstraction by temporal logic;online justification for tabled logic programs;a declarative debugging tool for functionallogic languages;an effective self-applicable partial evaluator for prolog;multivariant non failure analysis via standard abstract interpretation;implementing natural rewriting and narrowing efficiently;complete axiomatization of an algebraic construction of graphs;semantics of linear continuation-passing in call-by-name;basic pattern matching calculi and derivation of deterministic inverse programs based on LR parsing.
Narrowing extends rewriting withlogic capabilities by allowing logic variables in terms and replacing matching with unification. Narrowing has been widely used in different contexts, ranging from theorem proving to l...
详细信息
ISBN:
(纸本)9783540789680
Narrowing extends rewriting withlogic capabilities by allowing logic variables in terms and replacing matching with unification. Narrowing has been widely used in different contexts, ranging from theorem proving to language design. Surprisingly, the termination of narrowing has been mostly overlooked. In this paper, we present a new approach for analyzing the termination of narrowing in left-linear constructor systems-a widely accepted class of systems-that allows us to reuse existing methods in the literature on termination of rewriting.
Since linear logic was proposed by Girard, a number of type systems inspired by linear logic (or substructural logics in general) have been proposed. Examples include linear type systems, where the weakening and contr...
详细信息
ISBN:
(纸本)9783540789680
Since linear logic was proposed by Girard, a number of type systems inspired by linear logic (or substructural logics in general) have been proposed. Examples include linear type systems, where the weakening and contraction rules are restricted, and ordered type systems, where the exchange rule is also restricted. those type systems turned out to be very useful for reasoning about temporal properties of programs, like a memory cell is deallocated only once, or a memory cell is never read or written after it is deallocated. In this talk, I will focus on substructural type systems for program analysis, and review their principles and applications [1,2,3,4,5]. 1 will also discuss some emerging techniques and future directions of substructural-type-based program analysis.
Uncertainty in logicprogramming has been investigated since about 25 years, publishing papers dealing with various approaches to semantics and different applications. this paper is intended as a first step towards th...
详细信息
ISBN:
(纸本)9783540789680
Uncertainty in logicprogramming has been investigated since about 25 years, publishing papers dealing with various approaches to semantics and different applications. this paper is intended as a first step towards the investigation of uncertainty in Constraint functionallogicprogramming. We revise an early proposal, namely van Emden's Quantitative logicprogramming [22], and we improve it in two ways. Firstly, we generalize van Emden's QLP to a generic scheme QLP(D) parameterized by any given Qualification Domain D, which must be a lattice satisfying certain natural axioms. We present several interesting instances for D, one of which corresponds to van Emden's QLP. Secondly, we generalize van Emden's results by providing stronger ones, concerning both semantics and goal solving. We present Qualified SLD Resolution over D, a sound and strongly complete goal solving procedure for QLP(D), which is applicable to open goals and can be efficiently implemented using CLP technology over any constraint domain C-D able to deal with qualification constraints over D. We have developed a prototype implementation for van Emden's QLP as an instance of QLP(D), on top of the CFLP system TOY.
the field of knowledge representation and reasoning has been going through a methodological shift during recent years. While the past was dominated by query-oriented reasoning, model-based techniques become more and m...
详细信息
ISBN:
(纸本)9783540789680
the field of knowledge representation and reasoning has been going through a methodological shift during recent years. While the past was dominated by query-oriented reasoning, model-based techniques become more and more popular nowadays. this development was primarily driven by the availability of highly efficient Boolean constraint solvers, like satisfiability and answer set solvers. the general idea is to translate an application problem into a logical specification. this specification is in turn passed to a solver, which outputs models representing solutions to the initial application problem. the talk will provide an introduction to answer set programming (ASP), its proof-theoretic foundations, methodology, implementation techniques along with a glimpse of an exemplary application. Besides knowledge representation and reasoning, ASP has its roots in deductive databases, nonmonotonic reasoning, and logicprogramming. Applications are specified in ASP in terms of sets of logical rules. Modern ASP solvers rely on high-performance Boolean constraint solving techniques, which allow them to tackle application domains consisting of millions of variables. Meanwhile, this approach proved to be an effective tool in a range of applications, like planning, model checking, and bio-informatics.
We present a declarative method for diagnosing missing computed answers in , a generic scheme for lazy Constraint functional-logicprogramming which can be instantiated by any constraint domain given as parameter. As ...
详细信息
the proceedings contain 43 papers. the topics discussed include: on a hybrid symbolic-connectionist approach for modeling the kinematic robot map - and benchmarks for computer algebra;applying link grammar formalism i...
详细信息
ISBN:
(纸本)3540851097
the proceedings contain 43 papers. the topics discussed include: on a hybrid symbolic-connectionist approach for modeling the kinematic robot map - and benchmarks for computer algebra;applying link grammar formalism in the development of English-Indonesian machine translation system;case studies in model manipulation for scientific computing;mechanising a proof of Craig's interpolation theorem for intuitionistic logic in nominal Isabelle;ASIC meets natural typography;the monoids of order eight and nine;extending graphical representations for compact closed categories with applications to symbolic quantum computation;a full first-order constraint solver for decomposable theories;search techniques for rational polynomial orders;strategies for solving sat in grids by randomized search;towards an implementation of a computer algebra system in a functional language;and automated model building: from finite to infinite models.
暂无评论