Several methods to compute the prime implicants and the prime implicates of a negation normal form (NNF) formula are developed and implemented. An algorithm PI is introduced that is an extension to negation normal for...
详细信息
the proceedings contain 79 papers. the special focus in this conference is on Fundamentals of Computation theory. the topics include: Simulation-based comparison of hash functions for emulated shared memory;task manag...
ISBN:
(纸本)9783540568919
the proceedings contain 79 papers. the special focus in this conference is on Fundamentals of Computation theory. the topics include: Simulation-based comparison of hash functions for emulated shared memory;task management, virtual shared memory, and multithreading in a distributed memory implementation of sisal;simulating the data diffusion machine;an FP based programming language for efficient parallel programming of multiprocessor networks;the data-parallel categorical abstract machinedata parallel implementation of extensible sparse functional arrays;embeddings of tree-related networks in incomplete hypercubes;optimal mappings of m dimensional FFT communication to k dimensional mesh for arbitrary m and k;the united functions and objects approach;detection of recurrences in sequential programs with loops;parallel programming using skeleton functions;data-parallel portable software platform: principles and implementation;a compositional approach for fault-tolerance using specification transformation;concurrent metatem — a language for modelling reactive systems;trace-based compositional reasoning about fault tolerant systems;a kahn principle for networks of nonmonotonic real-time processes;adaptive multicast wormhole routing in 2D mesh multicomputer;the impact of packetization in wormhole-routed networks;a high-performance flat concurrent logicprogramming system;exploiting recursion-parallelism in prolog;why and how in the elipsys or-parallel CLP system;skewed-associative caches;trace-splitting for the parallel simulation of cache memory;locality and false sharing in coherent-cache parallel graph reduction;SLiD — a cost-effective and scalable limited-directory scheme for cache coherence and formal development of actor programs using structured algebraic petri nets.
We propose in this paper a type inference system for extracting inheritance hierarchies from Prolog programs. the inferred types define a superset of the denotation of the program, and a subset of the least fixed poin...
详细信息
this paper provides two results concerning Order-Sorted logic with Term Declarations. First, we show that linear term declarations can be transformed conservatively into function declarations, thus yielding elementary...
详细信息
Heuristic based theorem proving systems typically impose a fixed ordering on the strategies which they embody. the ordering reflects the general experience of the system designer. As a consequence, there will exist a ...
详细信息
In object-oriented representation, inheritance determines the attributes of a given object, given its type. Conversely, recognition determines the type of an object, given its attributes. In this paper, we address the...
详细信息
ISBN:
(纸本)0818628308
In object-oriented representation, inheritance determines the attributes of a given object, given its type. Conversely, recognition determines the type of an object, given its attributes. In this paper, we address the more general problem of recognition from constraints;we argue that it can be seen as a special case of the classical abduction process and that it can be implemented as an abduction operation on constraints. Abductive reasoning is common is most fields of artificialintelligence. Constraint logicprogramming (CLP) generalizes logicprogramming by replacing unification with Constraint Solving. We first explore the relationship between Abduction and CLP and show that CLP is a special case of abduction. A class of problems is then identified for which the usual unrestricted forms of abduction are unsuitable. Within the CLP framework a restricted form of abduction is formulated which is applicable to the whole class of problems, in which object-oriented recognition can be considered as a special case.
We have formally specified a substantial subset of the MC68020, a widely used microprocessor built by Motorola, within the mathematical logic of the automated reasoning system Nqthm, i.e., the Boyer-Moore theorem Prov...
详细信息
We present a method to compute abduction discussed in [3, 11, 12]. We translate an abductive framework into a general logic program with integrity constraints and show a correspondence between generalized stable model...
详细信息
ISBN:
(纸本)0262560585
We present a method to compute abduction discussed in [3, 11, 12]. We translate an abductive framework into a general logic program with integrity constraints and show a correspondence between generalized stable models defined in [11, 12] and stable models for the translation of the abductive framework. then, we show a procedure to compute stable models for a general logic program with integrity constraints. this procedure is based on a procedure of calculating a grounded extension [16] of Doyle's TMS [1] and can be regarded as an extension of a well-founded procedure to calculate stable models for a general logic program without integrity constraints [5, 15].
暂无评论