4573 search results - page 711 / 915 » Automated Reasoning |
118
Voted
TPHOL
2003
IEEE
15 years 9 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
148
Voted
ASP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
136
Voted
ASP
2003
Springer
15 years 8 months ago
2003
Springer
It is commonly believed that the meaning of a formal declarative knowledge representation language is determined by its formal semantics. This is not quite so. This paper shows an...
131
Voted
ASP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
166
click to vote
ASP
2003
Springer
15 years 8 months ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...