611 search results - page 46 / 123 » Yuri, Logic, and Computer Science |
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from an infinite domain. Over data words we consider the logic LTL↓ 1(F), th...
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
We introduce a systematic procedure to transform large classes of (Hilbert) axioms into equivalent inference rules in sequent and hypersequent calculi. This allows for the automat...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a Hoare logic for a simple imperative whilelanguage with stored commands, ie. stored parameterless procedures. Stores that may contain procedures are called hi...
105
click to vote
DSS
2002
14 years 9 months ago
2002
Recent research has sought to develop formal languages for business communication as more expressive, flexible and powerful alternatives to current electronic data interchange (ED...