2162 search results - page 201 / 433 » Automated Reasoning on Feature Models |
150
click to vote
LICS
1994
IEEE
15 years 8 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
140
click to vote
TPHOL
1994
IEEE
15 years 8 months ago
1994
IEEE
Verification Condition Generator (VCG) tools have been effective in simplifying the task of proving programs correct. However, in the past these VCG tools have in general not thems...
114
click to vote
ICLP
1990
Springer
15 years 8 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
129
Voted
FLOPS
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents a self-applicable partial evaluator for a considerable subset of full Prolog. The partial evaluator is shown to achieve non-trivial specialisation and be effect...
156
click to vote
CSL
2006
Springer
15 years 8 months ago
2006
Springer
The Hintikka-style modal logic approach to knowledge has a well-known defect of logical omniscience, i.e., an unrealistic feature that an agent knows all logical consequences of he...