We propose a new way of extending logicprogramming (LP) for reasoning with uncertainty. Probabilistic finite domains (Pfd) capitalise on ideas introduced by Constraint LP, on how to extend the reasoning capabilities ...
详细信息
ISBN:
(纸本)3540439307
We propose a new way of extending logicprogramming (LP) for reasoning with uncertainty. Probabilistic finite domains (Pfd) capitalise on ideas introduced by Constraint LP, on how to extend the reasoning capabilities of the LP engine. Unlike other approaches to the field, Pfd syntax can be intuitively related to the axioms defining Probability and to the underlying concepts of Probability theory, (PT) such as sample space, events, and probability function. Probabilistic variables are core computational units and have two parts. Firstly, a finite domain, which at each stage holds the collection of possible values that can be assigned to the variable, and secondly a probabilistic function that can be used to assign probabilities to the elements of the domain. the two constituents are kept in isolation from each other. there are two benefits in such an approach. Firstly, that propagation techniques from finite domains research are retained, since a domain’s representation is not altered. thus, a probabilistic variable continues to behave as a finite domain variable. Secondly, that the probabilistic function captures the probabilistic behaviour of the variable in a manner which is, to a large extent, independent of the particular domain values. the notion of events as used in PT can be captured by LP predicates containing probabilistic variables and the derives operator (⊢) as defined in LP. Pfd stores hold conditional constraints which are a computationally useful restriction of conditional probability from PT. Conditional constraints are defined by D1: π1⊕...⊕Dn: πn | Q1 ∧...∧ Qm where, Di and Qj are predicates and each πi is a probability measure (0 ≤ πi ≤ 1, 1 ≤ i ≤ n, 1 ≤ j ≤ m). the conjuction of Qj’s qualifies probabilistic knowledge about Di<
this paper presents KOOL, a concurrent, dynamic, object-oriented language defined in rewriting logic. KOOL has been designed as an experimental language, with a focus on making the language easy to extend. this is don...
详细信息
ISBN:
(纸本)9783540734475
this paper presents KOOL, a concurrent, dynamic, object-oriented language defined in rewriting logic. KOOL has been designed as an experimental language, with a focus on making the language easy to extend. this is done by taking advantage of the flexibility provided by rewriting logic, which allows for the rapid prototyping of new language features. An example of this process is illustrated by sketching the addition of synchronized methods. KOOL also provides support for program analysis through language extensions and the underlying capabilities of rewriting logic. this support is illustrated with several examples.
A tableau calculus for a logic with constructive negation and an implementation of the related decision procedure is presented. this logic is an extension of Nelson logic and it has been used in the framework of progr...
详细信息
ISBN:
(纸本)3540230246
A tableau calculus for a logic with constructive negation and an implementation of the related decision procedure is presented. this logic is an extension of Nelson logic and it has been used in the framework of program verification and timing analysis of combinatorial circuits. the decision procedure is tailored to shrink the search space of proofs and it is proved correct by using a semantical technique. It has been implemented in C++ language.
this volume contains the proceedings of ICALP '91, the 18th annual summer conference sponsored by the European Association for theoretical Computer Science (EATCS). ICALP stands for international Colloquium on Aut...
详细信息
ISBN:
(数字)9783540475163
ISBN:
(纸本)9783540542339
this volume contains the proceedings of ICALP '91, the 18th annual summer conference sponsored by the European Association for theoretical Computer Science (EATCS). ICALP stands for international Colloquium on Automata, Languages, and programming, and this conference series covers all important areas of theoretical computer science, such as: computability, automata, formal languages, data types and structures, theory of databases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic and functional programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, computational geometry, cryptography, and theory of robotics.
the proceedings contain 11 papers. the topics discussed include: Turing universality of step-wise and stage assembly at temperature 1;a type system for DNAQL;deterministic function computation with chemical reaction n...
ISBN:
(纸本)9783642322075
the proceedings contain 11 papers. the topics discussed include: Turing universality of step-wise and stage assembly at temperature 1;a type system for DNAQL;deterministic function computation with chemical reaction networks;reachability bounds for chemical reaction networks and strand displacement systems;synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly;a geometric approach to Gibbs energy landscapes and optimal DNA codeword design;a DNA based molecular logic gate capable of a variety of logical operations;deciding whether a regular language is generated by a splicing system;probabilistic reasoning with a Bayesian DNA device based on strand displacement;DNA self-assembly and computation studied with a coarse-grained dynamic bonded model;and space and energy efficient computation with DNA strand displacement systems.
Digital modelling and simulation of manufacturing processes find increasing use in the manufacturing industry. this provides an opportunity to use model information and carry them over into the software development ph...
详细信息
ISBN:
(纸本)9781728149646
Digital modelling and simulation of manufacturing processes find increasing use in the manufacturing industry. this provides an opportunity to use model information and carry them over into the software development phase to realise automatic PLC code generation. this paper extends the work presented in [1] to enable generation of function blocks for resource components rather than manually coding FBs. the approach is based on mapping table based that allow users to select required functionality, such as auto and manual control, diagnostic, return to initial position for machine components. this mapping table is filled by a programmer and links the information together. the approach provides a structured code that is generated in the IEC 61131-3 Structured Text. Additionally, the paper presents a use case as a proof of concept implementation. the approach is formalized and justified from the viewpoint of the RAMI4.0 specification and resulted in between 62 - 81 per cent time saving compared to manual coding of the FBs.
the proceedings contains 177 papers form the National conference on Artificial Intelligence. the topics discussed include: the yard allocation problem;graph coloring with quantum heuristics;on computing all abductive ...
详细信息
the proceedings contains 177 papers form the National conference on Artificial Intelligence. the topics discussed include: the yard allocation problem;graph coloring with quantum heuristics;on computing all abductive explanation;logicprogramming with ordered disjunction;progressive rademacher sampling;bootstrap learning for place recognition;extended isomap for pattern classification;and planning with a language for extended goals.
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a logic program, we show that by adding, for each loop program, a corresponding loo...
详细信息
ISBN:
(纸本)0262511290
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a logic program, we show that by adding, for each loop program, a corresponding loop formula to the program's completion, we obtain a one-to-one correspondence between the answer sets of the program. and the models of the resulting propositional theory. Compared withthe translation, by Ben-Eliyahu and Dechter, ours has the advantage that it does not use any extra variables, and is considerably simpler;thus easier to understand. However, in the worst case, it requires computing exponential number of loop formulas. To address this problem, we propose an approach that adds loop formulas a few at a time, selectively. Based on these results, we implemented a system called ASSAT(X), depending on the SAT solver X used, and tested it on a variety of benchmarks including, ing the graph coloring the blocks world planning, and Hamiltonian Circuit domains. the results are compared withthose by smodels and dlv, and it shows A clear-edge of ASSAT over them in these domains.
In the paper, we present a procedural semantics for fuzzy disjunctive programs - sets of graded strong literal disjunctions. We shall suppose that truth values constitute a complete Boolean lattice L = (L, less than o...
详细信息
ISBN:
(数字)9783540360780
ISBN:
(纸本)3540000100
In the paper, we present a procedural semantics for fuzzy disjunctive programs - sets of graded strong literal disjunctions. We shall suppose that truth values constitute a complete Boolean lattice L = (L, less than or equal to, boolean OR, boolean AND, double right arrow, 0, 1). A graded strong literal disjunction is a pair (D, c) where D is a strong literal disjunction of the form l(1)(V) over dot ... (V) over dot l(n) and c is a truth value from the lattice L. A graded disjunction can be understood as a means of the representation of incomplete and uncertain information, where the incompleteness is formalised by its strong literal disjunction, while the uncertainty by its truth degree. In the end, the coincidence of the procedural and fixpoint semantics, proposed in [18], will be reached.
In this paper we address the problem of declarative modeling of freight transportation brokering using agents and constraints. Our model can be used for the optimization of vehicle assignments to customer orders that ...
详细信息
ISBN:
(纸本)9783319651729;9783319651712
In this paper we address the problem of declarative modeling of freight transportation brokering using agents and constraints. Our model can be used for the optimization of vehicle assignments to customer orders that request the transportation of freight from source to destination points. the advantage is that a single vehicle can serve multiple customer orders on its multi-hop route that is part of a solution schedule. Our model is mapped to the ECLiPSe constraint logicprogramming system such that optimal schedules can be automatically computed using the available constraint solvers. We propose a method and protocol for integrating this constraint-based scheduler into a multi-agent system.
暂无评论