For a monoid M of k-valued unary functions, the centralizer M* of M is the set of k-valued multi-variable functions which commute with every function in M. In this paper, we determine centralizers for all monoids whic...
详细信息
Although the benefits of software acceleration using reconfigurable logic have been demonstrated repeatedly, this style of computing has not yet penetrated the mainstream. One of the biggest unsolved problems is the m...
详细信息
Although the benefits of software acceleration using reconfigurable logic have been demonstrated repeatedly, this style of computing has not yet penetrated the mainstream. One of the biggest unsolved problems is the management of the reconfigurable hardware in a multi-threaded environment. While most research in reconfigurable computing has assumed a single-threaded model, this is unrealistic for both personal computing and many types of embedded computing. In these cases, there may be several different threads running simultaneously. Each of these threads may have one or more sections of code (kernels) which would benefit from hardware acceleration. Somehow the operating system must decide at runtime which kernels to implement in software vs. hardware based on the status of the system. This includes potentially choosing from multiple possible hardware implementations (with different area/delay tradeoffs) of a single kernel. This paper examines our vision of reconfigurable computing applications in mainstream multithreaded systems, including a presentation of a proposed scheduling algorithm for allocating the reconfigurable hardware.
Debugging is one of the essential parts of the software development cycle. However, the usual debugging techniques used in imperative languages such as the step by step execution often are not suitable for debugging d...
详细信息
This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given ground disjunctive logic programs are equivalent, an...
详细信息
This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given ground disjunctive logic programs are equivalent, and if not, return a counter-example. This allows us to investigate some interesting properties of strong equivalence, such as a complete characterization for a rule to be strongly equivalent to another one, and checking whether a given set of rules is strongly equivalent to another, perhaps simpler set of rules.
In [1] we presented the language TOY (FD) that integrates the best features of existing functional and logic languages, as well as finite domain (FD) constraint solving. We believe that TOY (FD) is more flexible and e...
详细信息
ISBN:
(纸本)3540292381
In [1] we presented the language TOY (FD) that integrates the best features of existing functional and logic languages, as well as finite domain (FD) constraint solving. We believe that TOY (FD) is more flexible and expressive than the existing approaches of constraint logic programming on finite domain (CLP(FD)) as it integrates FD constraint solving, lazy evaluation, higher order applications of functions and constraints, polymorphism, type checking, composition of functions (and, in particular, constraints), combination of relational and functional notation, and a number of other characteristics. These features allow to write more concise programs, therefore increasing the expressivity level. Prom an implementation point of view, TOY (FD) integrates the higher-order lazy functional logic language TOY and the efficient FD constraint solver of SICStus Prolog. From a programming point of view, TOY (FD) is the first constraint functional logic programming system that provides a wide set of FD constraints comparable to existing CLP(FD) systems and which is competitive with them. TOY(FD) supports relational constraints including equality, disequality, arithmetical operators on constraints, a wide set of well-known global constraints (e.g., all_different/1), membership constraints (e.g., domain/3), propositional constraints, and enumeration constraints (e.g., labeling/2, with a number of strategies) with optimization. TOY (FD) also provides a glass box approach via a set of predefined functions called reflection constraints that allow, at runtime, to recover internal information about the constraint solving process. These functions increase the flexibility of the language as they allow the user to construct specific constraint mechanisms such as new search strategies. Generally speaking, TOY(FD) is, from its nature, different to all existing CLP(FD) languages as its operational mechanism is the result of combining the operational methods of logic languages (i.e., unific
In this paper, a rewrite theory for checking μ-calculus properties is developed. We use the same framework proposed in [11] and demonstrate how rewriting logic can be used as a unified formalism from model specificat...
详细信息
作者：
Delzanno, GEtalle, SUniv Genoa
Dipartimento Informat & Sci Informaz I-16146 Genoa Italy CWI
NL-1009 AB Amsterdam Netherlands Univ Twente
Fac Comp Sci NL-7500 AE Enschede Netherlands
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of principals and the current global state of...
详细信息
ISBN:
(纸本)3540439153
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of principals and the current global state of the session. Hereby, we can describe the operational semantics of principals and of an intruder in a simple and modular way. Furthermore, using proof theoretic tools like the analysis of permutability of rules, we are able to find efficient proof strategies that we prove complete for special classes of security protocols including Needham-Schroeder. Based on the results of this preliminary analysis, we have implemented a Prolog meta-interpreter which allows for rapid prototyping and for checking safety properties of security protocols, and we have applied it for finding error traces and proving correctness of practical examples.
This paper proposes a method for detecting misclassifications of a classification rule and then revising them. Given a rule and a set of examples, the method divides misclassifications by the rule into miscovered exam...
详细信息
We present an integrated approach for reasoning about and learning conversation patterns in multiagent communication. The approach is based on the assumption that information about the communication language and proto...
详细信息
We present an integrated approach for reasoning about and learning conversation patterns in multiagent communication. The approach is based on the assumption that information about the communication language and protocols available in a multiagent system is provided in the form of dialogue sequence patterns, possibly tagged with logical conditions and instance information. We describe an integrated social reasoning architecture m2InFFrA that is capable of (i) processing such patterns, (ii) making communication decisions in a boundedly rational way, and (iii) learning patterns and their strategic application from observation. Copyright 2005 ACM.
Tabling, or memoization, enables incremental evaluation of logic programs. When the rules or facts of a program change, we need to recompute only those results that are affected by the changes. The current algorithms ...
详细信息
暂无评论