2162 search results - page 178 / 433 » Automated Reasoning on Feature Models |
158
click to vote
TPHOL
2009
IEEE
15 years 11 months ago
2009
IEEE
ion and equality to base types but retains lambda abstractions and higher-order variables. We show that this fragment enjoys the characteristic properties of first-order logic: co...
117
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
We show how to extract classical programs expressed in Krivine λc-calculus from proof-terms built in a proof-irrelevant and classical version of the calculus of constructions with...
160
click to vote
ECSQARU
2005
Springer
15 years 10 months ago
2005
Springer
This paper is part of a project to match real-world descriptions of instances of objects to models of objects. We use a rich ontology to describe s and models at multiple levels of...
169
click to vote
ASP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and str...
126
click to vote
ICLP
1992
Springer
15 years 8 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...