Sciweavers

42 search results - page 8 / 9
» On the Compilability and Expressive Power of Propositional P...
Sort
View
AGP
2003
IEEE
13 years 10 months ago
Reasoning about the Semantic Web using Answer Set Programming
The paper discusses some innovative aspects related to the integration of a framework based on Answer Set Programming in an Information Retrieval Agent, namely, the Global Search A...
Giovambattista Ianni, Francesco Calimeri, Vincenzi...
ENTCS
2007
168views more  ENTCS 2007»
13 years 5 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
KBSE
2007
IEEE
13 years 11 months ago
Ensuring consistency in long running transactions
Flow composition languages permit the construction of longrunning transactions from collections of independent, atomic services. Due to environmental limitations, such transaction...
Jeffrey Fischer, Rupak Majumdar
KR
2004
Springer
13 years 11 months ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
SAS
2007
Springer
108views Formal Methods» more  SAS 2007»
13 years 11 months ago
Programming Language Design and Analysis Motivated by Hardware Evolution
Abstract. Silicon chip design has passed a threshold whereby exponentially increasing transistor density (Moore’s Law) no longer translates into increased processing power for si...
Alan Mycroft