Sciweavers

8337 search results - page 1455 / 1668
» Reasoning With Characteristic Models
Sort
View
LCPC
2007
Springer
15 years 11 months ago
Automatic Communication Performance Debugging in PGAS Languages
Recent studies have shown that programming in a Partition Global Address Space (PGAS) language can be more productive than programming in a message passing model. One reason for th...
Jimmy Su, Katherine A. Yelick
LPAR
2007
Springer
15 years 11 months ago
Completeness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
Marc Bezem, Tore Langholm, Michal Walicki
LPAR
2007
Springer
15 years 11 months ago
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Véronique Cortier, Stéphanie Delaune
LPAR
2007
Springer
15 years 11 months ago
How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited
Abstract. The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use nonsimple roles—that is, t...
Yevgeny Kazakov, Ulrike Sattler, Evgeny Zolin
LPNMR
2007
Springer
15 years 11 months ago
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...
« Prev « First page 1455 / 1668 Last » Next »