Sciweavers

351 search results - page 18 / 71
» Logic Programs with Compiled Preferences
Sort
View
ICLP
1998
Springer
14 years 25 days ago
Efficient Implementation of a Linear Logic Programming Language
A number of logic programming languages based on Linear Logic [3] have been proposed. However, the implementation techniques proposed for these languages have relied heavily on th...
Joshua S. Hodas, K. M. Watkins, Naoyuki Tamura, Ky...
PLDI
2006
ACM
14 years 2 months ago
Context-sensitive domain-independent algorithm composition and selection
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...
Troy A. Johnson, Rudolf Eigenmann
AI
2002
Springer
13 years 8 months ago
On the computational complexity of assumption-based argumentation for default reasoning
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
IEEESCC
2005
IEEE
14 years 2 months ago
Abacus: A Service-Oriented Programming Language for Grid Applications
This paper presents Abacus, a service-oriented programming language designed for the development of grid applications. Abacus considers that all the grid resources constitute a un...
Xiaoning Wang, Lijuan Xiao, Wei Li, Zhiwei Xu
POPL
2010
ACM
14 years 6 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala