Sciweavers

162 search results - page 11 / 33
» Advanced Techniques for Answer Set Programming
Sort
View
JAIR
2007
121views more  JAIR 2007»
13 years 7 months ago
On the Semantics of Logic Programs with Preferences
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
Sergio Greco, Irina Trubitsyna, Ester Zumpano
PARCO
2003
13 years 9 months ago
Cache Memory Behavior of Advanced PDE Solvers
Three different partial differential equation (PDE) solver kernels are analyzed in respect to cache memory performance on a simulated shared memory computer. The kernels implement...
Dan Wallin, Henrik Johansson, Sverker Holmgren
JELIA
2010
Springer
13 years 6 months ago
A Dynamic-Programming Based ASP-Solver
Abstract. We present a novel system for propositional Answer-Set Programming (ASP). This system, called dynASP, is based on dynamic programming and thus significantly differs fro...
Michael Morak, Reinhard Pichler, Stefan Rümme...
IJCAI
2001
13 years 9 months ago
A Comparative Study of Logic Programs with Preference
We are interested in semantical underpinnings for existing approaches to preference handling in extended logic programming (within the framework of answer set programming). As a s...
Torsten Schaub, Kewen Wang
JGAA
2000
85views more  JGAA 2000»
13 years 7 months ago
Techniques for the Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....