3845 search results - page 585 / 769 » Belief Logic Programming |
207
click to vote
ASP
2005
Springer
16 years 19 days ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
167
click to vote
ECOOP
2004
Springer
16 years 15 days ago
2004
Springer
Abstract. Programming with Java monitors is recognized to be difficult, and potentially inefficient due to many useless context switches induced by the notifyAll primitive. This pa...
194
click to vote
LPAR
2004
Springer
16 years 14 days ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
204
click to vote
PEPM
2004
ACM
16 years 13 days ago
2004
ACM
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
179
click to vote
COMPSAC
2003
IEEE
16 years 12 days ago
2003
IEEE
Usual techniques for automatic test data generation are based on the assumption that a complete oracle will be available during the testing process. However, there are programs fo...