1805 search results - page 68 / 361 » A Theory of Closure Operators |
116
click to vote
IFIPTCS
2000
15 years 7 months ago
2000
Abstract The sos formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to ch...
163
click to vote
CSL
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
137
click to vote
COMMA
2008
15 years 5 months ago
2008
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty a...
150
click to vote
DBA
2006
15 years 5 months ago
2006
: Recursive queries are required in many object-oriented database applications. Among them we can mention Bill-Of-Material (BOM), stock market dependencies, various kinds of networ...
150
click to vote
DLT
2003
15 years 5 months ago
2003
Past proposals for applying to pictures or 2D languages the generative grammar approach do not match in our opinion the elegance and descriptive adequacy that made Context Free gr...