Sciweavers

1117 search results - page 48 / 224
» Partial Models of Extended Generalized Logic Programs
Sort
View
AAAI
1998
13 years 10 months ago
Extending GENET to Solve Fuzzy Constraint Satisfaction Problems
Despite much research that has been done on constraint satisfaction problems (CSP's), the framework is sometimes inflexible and the results are not very satisfactory when app...
Jason H. Y. Wong, Ho-Fung Leung
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 8 months ago
Justifications for Logic Programs under Answer Set Semantics
The paper introduces the notion of off-line justification for Answer Set Programming (ASP). Justifications provide a graph-based explanation of the truth value of an atom w.r.t. a ...
Enrico Pontelli, Tran Cao Son, Omar El-Khatib
KI
2009
Springer
14 years 1 months ago
Beyond Public Announcement Logic: An Alternative Approach to Some AI Puzzles
In the paper we present a dynamic model of knowledge. The model is inspired by public announcement logic and an approach to a puzzle concerning knowledge and communication using th...
Pawel Garbacz, Piotr Kulicki, Marek Lechniak, Robe...
VMCAI
2009
Springer
14 years 3 months ago
LTL Generalized Model Checking Revisited
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...
Patrice Godefroid, Nir Piterman
WLP
2007
Springer
14 years 2 months ago
spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics
Answer-set programming (ASP) is an emerging logic-programming paradigm that strictly separates the description of a problem from its solving methods. Despite its semantic elegance,...
Martin Gebser, Jörg Pührer, Torsten Scha...