186 search results - page 19 / 38 » Completing Inverse Entailment |
121
click to vote
LPAR
2010
Springer
14 years 11 months ago
2010
Springer
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
105
click to vote
ICLP
1992
Springer
15 years 6 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
179
Voted
AI
2008
Springer
15 years 2 months ago
2008
Springer
The work in this paper is directed towards sophisticated formalisms for reasoning under probabilistic uncertainty in ontologies in the Semantic Web. Ontologies play a central role...
152
click to vote
PLDI
2011
ACM
14 years 4 months ago
2011
ACM
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
132
click to vote
AAAI
2006
15 years 3 months ago
2006
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...