Sciweavers

1194 search results - page 40 / 239
» A Language for Implementing Arbitrary Logics
Sort
View
DATESO
2009
101views Database» more  DATESO 2009»
14 years 7 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
ICGI
1994
Springer
15 years 1 months ago
Object-Oriented Inferences in a Logical Framework for Feature Grammars
: This paper deals on defining object-oriented inferences by desining a new unification procedure called ?-unification (which leads to a sound and complete resolution) in DF-logic,...
Liviu-Virgil Ciortuz
ICLP
2010
Springer
15 years 1 months ago
From Relational Specifications to Logic Programs
This paper presents a compiler from expressive, relational specifications to logic programs. Specifically, the compiler translates the Imperative Alloy specification language to...
Joseph P. Near
ICFP
2003
ACM
15 years 9 months ago
A formalization of an Ordered Logical Framework in Hybrid with applications to continuation machines
We report on work in progress devoted to the formalization of an Ordered Logical Framework (OLF) based on a two-level architecture [8] in the Hybrid system. OLF here is a second-or...
Alberto Momigliano, Jeff Polakow
BIRTHDAY
2012
Springer
13 years 5 months ago
Cryptography with Asynchronous Logic Automata
We introduce the use of asynchronous logic automata (ALA) for cryptography. ALA aligns the descriptions of hardware and software for portability, programmability, and scalability. ...
Peter Schmidt-Nielsen, Kailiang Chen, Jonathan Bac...