We study the analysis of downward closed properties of logic programs, which are a very abstract presentation of types. We generalise to a very large class of downward closed properties the construction of the traditi...
详细信息
Action semantics (AS) is a framework for specifying the semantics of programming languages, in a very modular and readable way. Recently, the operational semantics of action notation (action semantics’s specification...
详细信息
this paper presents the theoretical development of a complete navigation problem for use in an autonomous mobile robot. the situation for which the vehicle tries to reach the endpoint is treated by using a fuzzy logic...
详细信息
this paper presents the theoretical development of a complete navigation problem for use in an autonomous mobile robot. the situation for which the vehicle tries to reach the endpoint is treated by using a fuzzy logic controller. the problem of extracting the optimized If-then rule base is solved using an evolutionary algorithm. Simulation results show that the designed fuzzy controller achieves effectively any movement control of the vehicle from its current position to its end motion.
the general issues of designing the hybrid intelligent control systems based on rational combination of different knowledge processing technologies is discussed. the principles of structural construction of such syste...
详细信息
the general issues of designing the hybrid intelligent control systems based on rational combination of different knowledge processing technologies is discussed. the principles of structural construction of such systems are considered. A general approach to design of hierarchical intelligent control systems, based on the expert estimation of complexity of control object, its environment, control objective and subsequent determination of specifications to different control levels of the systems, is proposed. the example of design of hybrid intelligent system for control of autonomous mobile vehicle in the conditions of uncertainty is presented.
We explain why the original proofs of P-Time completeness for Light Affine logic and Light Linear logic can not work, and we fully develop a working one.
ISBN:
(纸本)3540665366
We explain why the original proofs of P-Time completeness for Light Affine logic and Light Linear logic can not work, and we fully develop a working one.
We give a category theoretic framework for data-refinement in call-by-value programming languages. One approach to data refinement for the simply typed lambda -calculus is given by generalising the notion of logical r...
详细信息
ISBN:
(纸本)3540665366
We give a category theoretic framework for data-refinement in call-by-value programming languages. One approach to data refinement for the simply typed lambda -calculus is given by generalising the notion of logical relation to one of lax logical relation, so that binary lax logical relations compose. So here, we generalise the notion of lax logical relation, defined in category theoretic terms, from the simply typed lambda -calculus to the computational lambda -calculus as a model of data refinement.
the proceedings contain 19 papers. the special focus in this conference is on programming Languages and Systems. the topics include: A decidable logic for describing linked data structures;interprocedural control flow...
ISBN:
(纸本)3540656995
the proceedings contain 19 papers. the special focus in this conference is on programming Languages and Systems. the topics include: A decidable logic for describing linked data structures;interprocedural control flow analysis;a per model of secure information flow in sequential programs;quotienting share for dependency analysis;types and subtypes for client-server interactions;types for safe locking;constructor subtyping;safe and principled language interoperation;deterministic expressions in C;a programminglogic for sequential java;set-based failure analysis for logic programs and concurrent constraint programs;simpler, and more expressive;type-based decompilation;an operational investigation of the CPS hierarchy;higher-order code splicing;expressing structural properties as language constructs;polytypic compact printing and parsing and dynamic programming via static incrementalization.
this paper represents the beginning of a study aimed at devising semantic models for true concurrency that provide clear distinctions between concurrency, paxallelism and choice. We present a simple programming langua...
详细信息
ISBN:
(纸本)3540665366
this paper represents the beginning of a study aimed at devising semantic models for true concurrency that provide clear distinctions between concurrency, paxallelism and choice. We present a simple programming language which includes (weakly) sequential composition, asynchronous and synchronous parallel composition, a restriction operator, and that supports recursion. We develop an operational and a denotational semantics for this language, and we obtain a theorem relating the behavior of a process as described by the transition system to the meaning of the process in the denotational model. this implies that the denotational model is adequate with respect to the operational model. Our denotational model is based on the resource traces of Gastin and Teodesiu, and since a single resource trace represents all possible executions of a concurrent process, we axe able to model each term of our concurrent language by a single trace. therefore we obtain a deterministic semantics for our language and we axe able to model parallelism without introducing nondeterminism.
the proceedings contain 41 papers. the special focus in this conference is on Verification, Temporal logic, Lambda Calculus, Linear logic and Descriptive Complexity. the topics include: Topological queries in spatial ...
ISBN:
(纸本)3540665366
the proceedings contain 41 papers. the special focus in this conference is on Verification, Temporal logic, Lambda Calculus, Linear logic and Descriptive Complexity. the topics include: Topological queries in spatial databases;constraint-based analysis of broadcast protocols;applicative control and computational complexity;applying rewriting techniques to the verification of erlang processes;an expressively complete temporal logic without past tense operators for mazurkiewicz traces;using fields and explicit substitutions to implement objects and functions in a de bruijn setting;a linear logical view of linear type isomorphisms;choice logic programs and Nash equilibria in strategic games;resolution method for modal logic with well-founded frames;fixpoint alternation and the game quantifier;open least element principle and bounded query computation;anti-symmetry of higher-order subtyping;monadic presentations of lambda terms using generalized inductive types;a logical viewpoint on process-algebraic quotients;data-refinement for call-by value programming languages and interactive theorem proving using type theory.
the proceedings contain 30 papers. the special focus in this conference is on Inductive logicprogramming. the topics include: Attribute-value learning versus inductive logicprogramming;advances in ILP theory and imp...
ISBN:
(纸本)3540647384
the proceedings contain 30 papers. the special focus in this conference is on Inductive logicprogramming. the topics include: Attribute-value learning versus inductive logicprogramming;advances in ILP theory and implementations;application of ILP to problems in chemistry and biology;relational reinforcement learning;learning first-order acyclic horn programs from entailment;combining statistical and relational methods for learning in hypertext domains;application of inductive logicprogramming to discover rules governing the three-dimensional topology of protein structure;term comparisons in first-order similarity measures;stochastic propositionalization of non-determinate background knowledge;a stochastic simple similarity;using prior probabilities and density estimation for relational classification;induction of constraint grammar-rules using progol;a hybrid approach to word segmentation;learning multilingual morphology with CLOG;using ILP systems for verification and validation of multi-agent systems;inducing shogi heuristics using inductive logicprogramming;repeat learning using predicate invention;normal programs and multiple predicate learning;strongly typed inductive concept learning;function-free horn clauses are hard to approximate;a GA-based relational learner;learning structurally indeterminate clauses;completing inverse entailment;distances and limits on herbrand interpretations;relational distance-based clustering;a framework for defining distances between first-order logic objects;detecting traffic problems with ILP and a comparison of ILP and propositional systems on propositional traffic data.
暂无评论