977 search results - page 88 / 196 » Logic programming with infinite sets |
AGP
1998
IEEE
15 years 4 months ago
1998
IEEE
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...
127
click to vote
ASP
2005
Springer
15 years 6 months ago
2005
Springer
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
132
Voted
JAR
2007
15 years 13 days ago
2007
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
197
click to vote
ECOOP
2009
Springer
16 years 1 months ago
2009
Springer
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...
103
click to vote
AGP
2003
IEEE
15 years 5 months ago
2003
IEEE
In ordered logic programs, i.e. partially ordered sets of clauses where smaller rules carry more preference, inconsistencies, which appear as conflicts between applicable rules, a...