the proceedings contain 24 papers. the special focus in this conference is on theory and Practice of Software Development. the topics include: Full abstraction for series-parallel pomsets;on causality observed increme...
ISBN:
(纸本)9783540539827
the proceedings contain 24 papers. the special focus in this conference is on theory and Practice of Software Development. the topics include: Full abstraction for series-parallel pomsets;on causality observed incrementally, finally;on the domain of traces and sequential composition;compilation of pattern matching with associative-commutative functions;algebraic graph rewriting using a single pushout;unifying initial and loose semantics of parameterized specifications in an arbitrary institution;program specification and data refinement in type theory;smile analysis of linear congruence equalities among variables of a program;simple solutions for approximate tree matching problems;the tree inclusion problem;introducing a calculus of trees;domains in a realizabifity framework;iteration algebras;logicprogramming as hypergraph rewriting;a fuuy abstract model for concurrent constraint programming;a solved form algorithm for ask and tell herbrand constraints;a calculus of broadcasting systems;on the complexity of equation solving in process algebra;comparative semantics for a real-time programming language with integration;a complete proof system for timed observations and type inference with inequalities.
In this paper, the decision problem of basic groups and basic semi-groups in partial multiple-valued logic is solved;meanwhile, it is proved that the precomplete classes which include non-trivial unary semi-group are ...
详细信息
ISBN:
(纸本)0769528740
In this paper, the decision problem of basic groups and basic semi-groups in partial multiple-valued logic is solved;meanwhile, it is proved that the precomplete classes which include non-trivial unary semi-group are fully determined by singular semi-group.
A neuron MOS transistor, abbreviated to a neuMOS, has more than two input gates. It is a highly functional device and has a potential to reduce the number of transistors and the area, compared with CMOS circuits. We p...
详细信息
A neuron MOS transistor, abbreviated to a neuMOS, has more than two input gates. It is a highly functional device and has a potential to reduce the number of transistors and the area, compared with CMOS circuits. We propose a module generator which generates 2-level neuMOS circuits for logic functions with small numbers of input variables. Using the module generator, we show 2-level neuMOS circuits for all 3-variable logic functions. (C) 1998 Elsevier Science Ltd. All rights reserved.
In this paper we investigate the logic MTL obtained by extending Esteva and Godo's logic MTL with an involutive negationfinot dependent on the t-norm and withthe Baaz's operator. Moreover, we also introduce a...
详细信息
ISBN:
(纸本)8476538723
In this paper we investigate the logic MTL obtained by extending Esteva and Godo's logic MTL with an involutive negationfinot dependent on the t-norm and withthe Baaz's operator. Moreover, we also introduce and study the related predicate calculus MTL8. algebraic and standard completeness results are shown to hold for both MTL and MTL8.
Given an abstract architecture for agents, we propose a concrete architecture integrating a situated object and a BD deliberation. Using an operational semantics given by a logic program, it is argued that these agent...
详细信息
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logicprogramming. We present several refinements of hig...
详细信息
ISBN:
(纸本)3540600434
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logicprogramming. We present several refinements of higher-order lazy narrowing for convergent (terminating and confluent) term rewrite systems and their application to program transformation. the improvements of narrowing include a restriction of narrowing at variables, generalizing the first-order case. Furthermore, functional evaluation via normalization is shown to be complete and a partial answer to the eager variable elimination problem is presented.
In this paper we relate two logical similarity-based approaches to approximate reasoning. One approach extends the framework of (propositional) classical logicprogramming by introducing a similarity relation in the a...
详细信息
ISBN:
(纸本)8476538723
In this paper we relate two logical similarity-based approaches to approximate reasoning. One approach extends the framework of (propositional) classical logicprogramming by introducing a similarity relation in the alphabet of the language that allows for an extended unification procedure. the second approach is a many-valued modal logic approach where 3p is understood as approximately p. Here, the similarity relations are introduced at the level of the Kripke models where possible worlds can be similar to some extent. We show that the former approach can be expressed inside the latter.
Basing on the algebraic representation of Petri net models of Ada tasking programs, we have defined a set of linear programming problems to support the static analysis of various queries about tasking behavior, such a...
详细信息
ISBN:
(纸本)0818628308
Basing on the algebraic representation of Petri net models of Ada tasking programs, we have defined a set of linear programming problems to support the static analysis of various queries about tasking behavior, such as queries about deadlock existence, possible parallelism, possible occurrence of an event, reachable states, definite occurrence of events, and quantitative questions. the linear programming problems are defined in such a way that their solutions can be used to guide net simulation to confirm the analysis conclusion. the stress of this method is that the enumeration of the entire state space of a Petri net is avoided. the defined problems are valid as long as the underlying net model is a safe net.
We describe an Interpreter for the programming language predicate logic. Some topics are;syntax and proof procedure, procedure evocation, function transformation, goal variation and interactive computational control. ...
详细信息
programming language is known among computer science students. One should know at least one programming language throughout their studies. However, mastering one programming language is challenging. Most of the new st...
详细信息
暂无评论