the proceedings contain 31 papers. the topics discussed include: frontiers and open sets in abstract interpretation;separating binding times in language specifications;separating binding times in language specificatio...
ISBN:
(纸本)0897913280
the proceedings contain 31 papers. the topics discussed include: frontiers and open sets in abstract interpretation;separating binding times in language specifications;separating binding times in language specifications;replacing function parameters by global variables;compile-time garbage collection by sharing analysis;compilation as partitioning: a new approach to compiling non-strict functional languages;untagged data in tagged environments: choosing optimal representations at compile time;improving the three instruction machine;stacklessness: compiling recursion for a distributed architecture;transformations on higher-order functions;a composition approach to time analysis of first order lazy functional programs;retrieving reusable software components by polymorphic type;using types as search keys in function libraries;parallel graph reduction withthe (v , G)-machine;An abstract machine for parallel graph reduction;P-TAC: a parallel intermediate language;architectural improvements for data-driven VLSI processing arrays;strictness analysis: a new perspective based on type inference;f-bounded polymorphism for object-oriented programming;a simple semantics for ML polymorphism;on the complexity of type inference with coercion;extended projection-new method to extract efficient programs from constructive proofs;and set abstraction in functional and logicprogramming.
In this paper, the main functionalities of a WEB Programmable logic Controller (PLC) Simulator for programming in Structure Text (ST) language, in the context of industrial automation and control, are presented. the a...
详细信息
Artificial Intelligence is a booming technology and is applied in almost every domain of application. To design an intelligent system, a thorough understanding of complex AI Algorithm is required. the idea behind the ...
详细信息
the proceedings contain 21 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: Using a declarative language to build an experimental analysis tool;how to ...
ISBN:
(纸本)354043092X
the proceedings contain 21 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: Using a declarative language to build an experimental analysis tool;how to talk to your computer so that it will listen;single-threaded objects in ACL2;modeling engineering structures with constrained objects;compiler construction in higher order logicprogramming;declarative programming and clinical medicine;semantics-based filtering: logicprogramming’s killer app?;linear scan register allocation in a high-performance erlang compiler;compiling embedded programs to byte code;typed combinators for generic traversal;event-driven FRP;adding apples and oranges;wash/CGI: server-side web scripting with sessions and typed, compositional forms;a better xml parser through functional programming;functional approach to texture generation;abstract interpretation over non-deterministic finite tree automata for set-based analysis of logic programs;a high-level generic interface to external programming languages for eclipse;a debugging scheme for declarative equation based modeling languages;segment order preserving and generational garbage collection for prolog;exploiting efficient control and data structures in logic programs and suspending and resuming computations in engines for SLG evaluation.
In automatic mapping of parallel programs to target parallel machines the efficiency of the compile-time cost estimation needed to steer the optimization process is highly dependent on the choice of programming model....
详细信息
In automatic mapping of parallel programs to target parallel machines the efficiency of the compile-time cost estimation needed to steer the optimization process is highly dependent on the choice of programming model. Recently a new parallel programming model, called SPC, has been introduced that specifically aims at the efficient computation of reliable cost estimates, paving the way for automatic mapping. In SPC all algorithm level parallelism is explicitly specified, relying on compile-time transformation of the possibly unbounded algorithm level (data) parallelism to that of the actual target machine. In this paper we present SPC's process-algebraic framework in terms of which we demonstrate that the transformations needed to efficiently support unbounded process parallelism at program level are straightforward.
Reasoning under fuzzy uncertainty arises in many applications including planning and scheduling in fuzzy environments. In many real-world applications, it is necessary to define fuzzy uncertainty over qualitative unce...
详细信息
ISBN:
(纸本)9783642159503
Reasoning under fuzzy uncertainty arises in many applications including planning and scheduling in fuzzy environments. In many real-world applications, it is necessary to define fuzzy uncertainty over qualitative uncertainty, where fuzzy values are assigned over the possible outcomes of qualitative uncertainty. However, current fuzzy logicprogramming frameworks support only reasoning under fuzzy uncertainty. Moreover, disjunctive logic programs, although used for reasoning under qualitative uncertainty it cannot be used for reasoning with fuzzy uncertainty. In this paper we combine extended and normal fuzzy logic programs [30, 23], for reasoning under fuzzy uncertainty, with disjunctive logic programs [7, 4], for reasoning under qualitative uncertainty, in a unified logicprogramming framework, namely extended and normal disjunctive fuzzy logic programs. this is to allow directly and intuitively to represent and reason in the presence of both fuzzy uncertainty and qualitative uncertainty. the syntax and semantics of extended and normal disjunctive fuzzy logic programs naturally extends and subsumes the syntax and semantics of extended and normal fuzzy logic programs [30, 23] and disjunctive logic programs [7, 4]. Moreover, we show that extended and normal disjunctive fuzzy logic programs can be intuitively used for representing and reasoning about scheduling with fuzzy preferences.
Search is one of the more common strategies used by problem-solving agents. For many hard problems, a backtracking search can be the most effective approach for finding a solution. logicprogramming languages provide,...
详细信息
ISBN:
(纸本)9781665437363
Search is one of the more common strategies used by problem-solving agents. For many hard problems, a backtracking search can be the most effective approach for finding a solution. logicprogramming languages provide, as a core feature of the language, the mechanics for the search behind the scenes without requiring the user to specify the algorithm. However, this functionality has been generally left out of the core features of imperative programming languages. In this work we propose integrating a search agent into an imperative programming language through a search construct in the syntax. By doing so, our intention is that the user may apply a model-based approach to problem solving. We extend the Go programming language withthis search construct and develop an agent to perform the search. the algorithm behind the search is implicitly handled by the agent. We demonstrate the effectiveness of this search construct through solutions to an exhaustive search over a file-system, the NQueens problem, and the monkey and the bananas problem.
A robust sequential primal-dual linear programming formulation for reactive power optimization is developed and discussed in this paper. the algorithm has the characteristic that no approximations or complicate contro...
详细信息
A robust sequential primal-dual linear programming formulation for reactive power optimization is developed and discussed in this paper. the algorithm has the characteristic that no approximations or complicate control logic are required in the basic Sequential Linear programming (SLP) formulation as used by other SLP algorithms reported in the literature. Transmission loss minimization is used as the primary objective. A secondary feasibility improvement objective is used which results in better feasible solution in comparison withthe loss minimization objective especially when the initial base case has over voltages. Modification in the proposed method to obtain the limited amount and limited movement of controller solution for real time application is also presented. the algorithm has been tested on Ward and Hale 6-Bus system.
this paper discusses an interpretation of relation algebra and fork algebra with respect to FCA contexts. In this case, "relation algebra" refers to the DeMorgan-Peirce-Schroeder-Tarski algebra and not to th...
详细信息
ISBN:
(纸本)3540322035
this paper discusses an interpretation of relation algebra and fork algebra with respect to FCA contexts. In this case, "relation algebra" refers to the DeMorgan-Peirce-Schroeder-Tarski algebra and not to the "relational algebra" as described by Codd. the goal of this interpretation is to provide an algebraic formalisation of object-relational databases that is based on binary relations and thus closer to FCA and formal contexts than the traditional formalisation based on Codd. the formalisation provides insights into certain symmetries (among quantifiers) and the use of ternary relations and part-whole relations for building relational databases.
We propose answer-set programs that specify and compute counterfactual interventions as a basis for causality-based explanations to decisions produced by classification models. they can be applied with black-box model...
详细信息
ISBN:
(纸本)9783030579777;9783030579760
We propose answer-set programs that specify and compute counterfactual interventions as a basis for causality-based explanations to decisions produced by classification models. they can be applied with black-box models and models that can be specified as logic programs, such as rule-based classifiers. the main focus is on the specification and computation of maximum responsibility causal explanations. the use of additional semantic knowledge is investigated.
暂无评论