Sciweavers

245 search results - page 7 / 49
» Efficient Solving of Time-dependent Answer Set Programs
Sort
View
AGP
2003
IEEE
14 years 11 days ago
Solving Hard Disjunctive Logic Programs Faster (Sometimes)
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
Gerald Pfeifer
KSEM
2010
Springer
13 years 5 months ago
A Formalism for Causal Explanations with an Answer Set Programming Translation
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
Yves Moinard
ASP
2003
Springer
13 years 10 months ago
Answer Set Programming with Templates
The work aims at extending Answer Set Programming (ASP) with the possibility of quickly introducing new predefined constructs and to deal with compound data structures: we show ho...
Giovambattista Ianni, Giuseppe Ielpa, Adriana Piet...
CONSTRAINTS
2008
121views more  CONSTRAINTS 2008»
13 years 7 months ago
Modeling Biological Networks by Action Languages via Answer Set Programming
We describe an approach to modeling biological networks by action languages via answer set programming. To this end, we propose an action language for modeling biological networks...
Steve Dworschak, Susanne Grell, Victoria J. Nikifo...
LPNMR
2007
Springer
14 years 1 months ago
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...