Results 1  10
of
118
Efficient Turinguniversal computation with DNA polymers (extended abstract)
"... Abstract. Bennett’s proposed chemical Turing machine is one of the most important thought experiments in the study of the thermodynamics of computation. Yet the sophistication of molecular engineering required to physically construct Bennett’s hypothetical polymer substrate and enzyme has deterred e ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
Abstract. Bennett’s proposed chemical Turing machine is one of the most important thought experiments in the study of the thermodynamics of computation. Yet the sophistication of molecular engineering required to physically construct Bennett’s hypothetical polymer substrate and enzyme has deterred
BSPk: Low Overhead Communication Constructs and Logical Barriers for Bulk Synchronous Parallel Programming (Extended Abstract)
, 1996
"... Communication and synchronization stand as the dual bottlenecks in the performance of parallel systems, and especially those that attempt to alleviate the programming burden by incurring overhead in these two domains. We formulate the notions of communicable memory and lazy barriers to help achie ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
achieve efficient communication and synchronization. These concepts are developed in the context of BSPk, a toolkit library for programming networks of workstationsand other distributed memory architectures in generalbased on the Bulk Synchronous Parallel (BSP) model. BSPk, whose design
A bottomup method for the deterministic Horn fragment of the description logic ALC
 Proceedings of JELIA 2006, LNAI 4160
, 2006
"... Abstract. We study the deterministic Horn fragment of ALC, which restricts the general Horn fragment of ALC only in that, the constructor ∀R.C is allowed in bodies of program clauses and queries only in the form ∀∃R.C, which is defined as ∀R.C ⊓∃R.C. We present an algorithm that for a deterministic ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
positive logic program P given as a TBox constructs a finite least pseudomodel I of P such that for every deterministic positive concept C, P  = C iff I validates C (and more strongly, iff I,τ  = C, whereτ is the distinguished object of I and the satisfaction means τ is an instance of C w.r.t. I
Le Fun: Logic, equations, and Functions
 In Proc. 4th IEEE Internat. Symposium on Logic Programming
, 1987
"... Abstract † We introduce a new paradigm for the integration of functional and logic programming. Unlike most current research, our approach is not based on extending unification to generalpurpose equation solving. Rather, we propose a computation delaying mechanism called residuation. This allows a ..."
Abstract

Cited by 44 (1 self)
 Add to MetaCart
clear distinction between functional evaluation and logical deduction. The former is based on the λcalculus, and the latter on Horn clause resolution. In clear contrast with equationsolving approaches, our model supports higherorder function evaluation and efficient compilation of both functional
Models and Abstractions
 in Design, Design Studies
, 1991
"... Architectural advances of modern systems has often been at odds with control complexity, requiring significant effort in both design and verification. This is particularly true for sequential controllers, where machine complexity can quickly surpass designer ability. Traditional solutions to this pr ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
to this problem require elaborate specifications that are difficult to maintain and extend. Further, the logic generated from these specifications bares no resemblance to the intended behavior and often fails to meet design performance constraints. In the process of designing a multithreaded, dynamically
A Theory of Modules for Logic Programming
 In Symp. Logic Programming
, 1986
"... Abstract: We present a logical language which extends the syntax of positive Horn clauses by permitting implications in goals and in the bodies of clauses. The operational meaning of a goal which is an implication is given by the deduction theorem. That is, a goal D ⊃ G is satisfied by a program P i ..."
Abstract

Cited by 45 (6 self)
 Add to MetaCart
Abstract: We present a logical language which extends the syntax of positive Horn clauses by permitting implications in goals and in the bodies of clauses. The operational meaning of a goal which is an implication is given by the deduction theorem. That is, a goal D ⊃ G is satisfied by a program P
Extended Caching and Backjumping for Expressive Description Logics
"... Due to the wide range of modelling constructs supported by the expressive DL SROIQ, the typically used tableau algorithms in competitive reasoning systems such as FaCT++ [16], HermiT, 3 or Pellet [14] have a very high worstcase complexity. The development of tableau optimisations that help to achie ..."
Abstract
 Add to MetaCart
Due to the wide range of modelling constructs supported by the expressive DL SROIQ, the typically used tableau algorithms in competitive reasoning systems such as FaCT++ [16], HermiT, 3 or Pellet [14] have a very high worstcase complexity. The development of tableau optimisations that help
A Logical Analysis of
, 1
"... We present a logical language which extends the syntax of positive Horn clauses by permitting implications in goals and in the bodies of clauses. The operational meaning of a goal which is an implication is given by the deduction theorem: a goal D provable from a program if the goal G is prova ..."
Abstract
 Add to MetaCart
and then unload that code after G succeeds or fails. This extended use of implication provides a logical explanation of parametric modules, some uses of Prolog's assert predicate, and aspects of abstract datatypes. Both a model theory and proof theory are presented for this logical language. In particular
A Hierarchy of Semantics for Normal Constraint Logic Programs
 PROC. FIFTH INT'L CONF. ON ALGEBRAIC AND LOGIC PROGRAMMING, VOLUME 1139 OF LECTURE NOTES IN COMPUTER SCIENCE
, 1996
"... The different properties characterizing the operational behavior of logic programs can be organized in a hierarchy of fixpoint semantics related by Galois insertions, having the least Herbrand model as most abstract semantics, and the SLD operational semantics as most concrete semantics. The cho ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
The different properties characterizing the operational behavior of logic programs can be organized in a hierarchy of fixpoint semantics related by Galois insertions, having the least Herbrand model as most abstract semantics, and the SLD operational semantics as most concrete semantics
Alternating Automata Semantic Constructions for the Bounded Model Checking of Regular Linear Temporal Logic
"... Abstract—We present two algorithms for bounded model checking of Regular Linear Temporal Logic (RLTL) specifications. Bounded model checking (BMC) is an effective algorithmic method for the verification of finite state systems against temporal specifications expressed in some linear temporal logic, ..."
Abstract
 Add to MetaCart
Abstract—We present two algorithms for bounded model checking of Regular Linear Temporal Logic (RLTL) specifications. Bounded model checking (BMC) is an effective algorithmic method for the verification of finite state systems against temporal specifications expressed in some linear temporal logic
Results 1  10
of
118