Sciweavers

367 search results - page 41 / 74
» Prolog
Sort
View
AMC
2006
89views more  AMC 2006»
13 years 8 months ago
A functional computation model for the duality of two-variable Lambda-Boolean functions
This paper presents a new functional computation model for developing a class of two-variable Lambda-Boolean functions, and describes the properties of the duality principle on th...
Tolga Güyer, Seref Mirasyedioglu
CL
2000
Springer
13 years 7 months ago
Semantics of well-moded input-consuming logic programs
Recent logic programming languages employ dynamic scheduling of calls to improve e ciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically &quo...
Annalisa Bossi, Sandro Etalle, Sabina Rossi
ML
2000
ACM
13 years 7 months ago
Multistrategy Discovery and Detection of Novice Programmer Errors
Detecting and diagnosing errors in novice behavior is an important student modeling task. In this paper, we describe MEDD, an unsupervised incremental multistrategy system for the ...
Raymund Sison, Masayuki Numao, Masamichi Shimura
JAR
1998
60views more  JAR 1998»
13 years 7 months ago
Elimination of Self-Resolving Clauses
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
Hans Jürgen Ohlbach
AI
2011
Springer
13 years 2 months ago
Stable models and circumscription
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz