Sciweavers

443 search results - page 47 / 89
» SAT-Based Answer Set Programming
Sort
View
AGP
2003
IEEE
14 years 1 months 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
CORR
2002
Springer
98views Education» more  CORR 2002»
13 years 7 months ago
A Framework for Compiling Preferences in Logic Programs
We introduce a methodology and framework for expressing general preference information in logic programming under the answer set semantics. An ordered logic program is an extended...
James P. Delgrande, Torsten Schaub, Hans Tompits
ECAI
2000
Springer
14 years 5 days ago
Logic Programs with Compiled Preferences
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
James P. Delgrande, Torsten Schaub, Hans Tompits
VL
2008
IEEE
111views Visual Languages» more  VL 2008»
14 years 2 months ago
Tool support for working with sets of source code entities
Previous research has identified several challenges that programmers face in answering questions about a code base. To explore ways to overcome those challenges, we have develope...
Curtis Fraser, Chris Luce, Jamie Starke, Jonathan ...
IJCAI
1989
13 years 9 months ago
Logic Programming with General Clauses and Defaults Based on Model Elimination
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
Marco A. Casanova, Ramiro A. de T. Guerreiro, Andr...