1916 search results - page 253 / 384 » Reasoning with class algebra |
192
Voted
CSL
2009
Springer
15 years 11 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
246
Voted
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
172
click to vote
WWW
2010
ACM
16 years 2 months ago
2010
ACM
We present a tool for helping XML schema designers to obtain a high quality level for their specifications. The tool allows one to analyze relations between classes of XML docume...
279
Voted
LOPSTR
2009
Springer
16 years 1 months ago
2009
Springer
Answer Set Programming (ASP) is a powerful paradigm of logic programming for non-monotonic reasoning. However, the restriction of “grounded range-restricted function-free normal ...
164
click to vote
OOPSLA
2009
Springer
16 years 1 months ago
2009
Springer
Objects model the world, and state is fundamental to a faithful modeling. Engineers use state machines to understand and reason about state transitions, but programming languages ...