Name
Abstract | ||
|---|---|---|
. We propose a variant of ordered resolution with semantic restrictionsbased on interpretations which are identified by the given atomordering and selection function. Techniques for effectively approximatingvalidity (satisfiability) in these interpretations are presented. Theyare related to methods of soft typing for programming languages. Theframework is shown to be strictly more general than certain previouslyintroduced approaches. Implementation of some of our techniques in theSpass... |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/3-540-63104-6_32 | CADE |
Keywords | DocType | Volume |
soft typing,ordered resolution,programming language,satisfiability | Conference | 1249 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-63104-6 | 19 |
PageRank | References | Authors |
1.64 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Harald Ganzinger | 1 | 1513 | 155.21 |
| Christoph Meyer | 2 | 19 | 1.64 |
| Christoph Weidenbach | 3 | 535 | 52.56 |