Sciweavers

4257 search results - page 482 / 852
» The Logical Modularity of Programs
Sort
View
176
Voted
AI
2002
Springer
15 years 6 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
178
Voted
DLOG
2009
15 years 4 months ago
A Matter of Principles: Towards the Largest DLP Possible
Abstract. Description Logic Programs (DLP) have been described as a description logic (DL) that is in the "expressive intersection" of DL and datalog. This is a very weak...
Markus Krötzsch, Sebastian Rudolph
POPL
2009
ACM
16 years 1 months ago
Speculative N-Way barriers
Speculative execution is an important technique that has historically been used to extract concurrency from sequential programs. While techniques to support speculation work well ...
Lukasz Ziarek, Suresh Jagannathan, Matthew Fluet, ...
171
Voted
MODELS
2007
Springer
16 years 1 months ago
Enhancing UML State Machines with Aspects
Abstract. Separation of Concerns (SoC) is an important issue to reduce the complexity of software. Recent advances in programming language research show that Aspect-Oriented Progra...
Gefei Zhang, Matthias M. Hölzl, Alexander Kna...
ICLP
2004
Springer
16 years 7 days ago
Protein Folding Simulation in CCP
A protein is identified by a finite sequence of aminoacids, each of them chosen from a set of 20 elements. The Protein Structure Prediction Problem is the problem of predicting t...
Alessandro Dal Palù, Agostino Dovier, Feder...