3342 search results - page 132 / 669 » Automating Abstract Interpretation |
LICS
1994
IEEE
15 years 3 months ago
1994
IEEE
The original semantics of Evaluation Logic in [Mog93] relies on additional properties of strong monads. This paper extends the original semantics by dropping all additional requir...
113
click to vote
LPAR
1994
Springer
15 years 3 months ago
1994
Springer
In this paper we develop a generic declarative diagnoser for normal logic programs that is based on tree search. The soundness and the completeness of the diagnoser are proved. The...
115
click to vote
LICS
1997
IEEE
15 years 2 months ago
1997
IEEE
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
100
click to vote
DLOG
2008
15 years 1 months ago
2008
Many visualization frameworks for ontologies in general and for concept expressions in particular are too faithful to the syntax of the languages in which those objects are represe...
DLOG
2003
15 years 17 days ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...