Sciweavers

4854 search results - page 64 / 971
» It's the Programming, Stupid
Sort
View
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 6 months ago
Mechanized semantics
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
Xavier Leroy
OOPSLA
2010
Springer
15 years 4 months ago
Modular logic metaprogramming
In logic metaprogramming, programs are not stored as plain textfiles but rather derived from a deductive database. While the benefits of this approach for metaprogramming are ob...
Karl Klose, Klaus Ostermann
ICLP
2009
Springer
16 years 6 months ago
One More Decidable Class of Finitely Ground Programs
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
Yuliya Lierler, Vladimir Lifschitz
ASP
2003
Springer
15 years 11 months ago
Suitable Graphs for Answer Set Programming
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
Thomas Linke
VL
1992
IEEE
194views Visual Languages» more  VL 1992»
15 years 10 months ago
Graphical Constraints in CoDraw
Constraint based draw programs require users to understand and manage relationships between drawing elements. By establishing constraint relationships among elements the user effe...
Mark D. Gross