Sciweavers

492 search results - page 47 / 99
» Integrating Ontology Languages and Answer Set Programming
Sort
View
ICLP
2009
Springer
14 years 9 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
ICSE
1997
IEEE-ACM
14 years 25 days ago
Lackwit: A Program Understanding Tool Based on Type Inference
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...
Robert O'Callahan, Daniel Jackson
GPCE
2005
Springer
14 years 2 months ago
Language Requirements for Large-Scale Generic Libraries
Abstract. The past decade of experience has demonstrated that the generic programming methodology is highly effective for the design, implementation, and use of large-scale softwar...
Jeremy G. Siek, Andrew Lumsdaine
DEXA
2005
Springer
110views Database» more  DEXA 2005»
14 years 2 months ago
Intensional Encapsulations of Database Subsets via Genetic Programming
Finding intensional encapsulations of database subsets is the inverse of query evaluation. Whereas query evaluation transforms an intensional expression (the query) to its extensi...
Aybar C. Acar, Amihai Motro
VL
2003
IEEE
126views Visual Languages» more  VL 2003»
14 years 1 months ago
Preserving non-programmers' motivation with error-prevention and debugging support tools
A significant challenge in teaching programming to disadvantaged populations is preserving learners’ motivation and confidence. Because programming requires such a diverse set o...
Andrew Jensen Ko