5506 search results - page 80 / 1102 » Minimal Logic Programs |
121
Voted
JUCS
2006
15 years 22 days ago
2006
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
104
click to vote
ICFP
2003
ACM
16 years 22 days ago
2003
ACM
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
126
Voted
ASP
2005
Springer
15 years 6 months 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...
113
Voted
LPAR
2004
Springer
15 years 6 months 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...
115
click to vote
PEPM
2004
ACM
15 years 6 months 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 ...