Sciweavers

413 search results - page 33 / 83
» On the Relation Between ID-Logic and Answer Set Programming
Sort
View
APLAS
2011
ACM
12 years 7 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
ORDER
2010
110views more  ORDER 2010»
13 years 6 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry
KBSE
2002
IEEE
14 years 19 days ago
Generating Product-Lines of Product-Families
GenVoca is a methodology and technology for generating product-lines, i.e. building variants of a program. The primitive components from which applications are constructed are ref...
Don S. Batory, Roberto E. Lopez-Herrejon, Jean-Phi...
IWPC
2009
IEEE
14 years 2 months ago
Intensions are a key to program comprehension
The classical comprehension theories study relations between extensions, intensions, and names. Originally developed in linguistics and mathematics, these theories are applicable ...
Václav Rajlich
LREC
2010
132views Education» more  LREC 2010»
13 years 9 months ago
A Question-answer Distance Measure to Investigate QA System Progress
The performance of question answering system is evaluated through successive evaluations campaigns. A set of questions are given to the participating systems which are to find the...
Guillaume Bernard, Sophie Rosset, Martine Adda-Dec...