Sciweavers

3515 search results - page 504 / 703
» On the semantics of Strategy Logic
Sort
View
POPL
2011
ACM
14 years 10 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
RTA
1995
Springer
15 years 11 months ago
Prototyping Completion with Constraints Using Computational Systems
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
Hélène Kirchner, Pierre-Etienne More...
WADT
2004
Springer
16 years 23 days ago
Type Class Polymorphism in an Institutional Framework
Higher-order logic with shallow type class polymorphism is widely used as a specification formalism. Its polymorphic entities (types, operators, axioms) can easily be equipped wit...
Lutz Schröder, Till Mossakowski, Christoph L&...
BMCBI
2005
116views more  BMCBI 2005»
15 years 7 months ago
Which gene did you mean?
Computational Biology needs computer-readable information records. Increasingly, meta-analysed and pre-digested information is being used in the follow up of high throughput exper...
Barend Mons
DAGSTUHL
1996
15 years 8 months ago
Global Control for Partial Deduction through Characteristic Atoms and Global Trees
Recently, considerable advances have been made in the (on-line) control of logic program specialisation. A clear conceptual distinction has been established between local and glob...
Michael Leuschel, Bern Martens