Sciweavers

615 search results - page 3 / 123
» Completeness of Combinations of Constructor Systems
Sort
View
ISJ
1998
82views more  ISJ 1998»
13 years 5 months ago
Successfully completing case study research: combining rigour, relevance and pragmatism
The organizational and social issues associated with the development, implementation and use of computer-based information systems have increasingly attracted the attention of info...
Peta Darke, Graeme G. Shanks, Marianne Broadbent
KBSE
2000
IEEE
13 years 9 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula
MFCS
1997
Springer
13 years 9 months ago
When are Two Rewrite Systems More than None?
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...
Nachum Dershowitz
FLOPS
2010
Springer
13 years 3 months ago
Proving Injectivity of Functions via Program Inversion in Term Rewriting
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...
Naoki Nishida, Masahiko Sakai
ICCS
2005
Springer
13 years 11 months ago
Applications of Description Logics: State of the Art and Research Challenges
Abstract. Description Logics (DLs) are a family of class based knowledge representation formalisms characterised by the use of various constructors to build complex classes from si...
Ian Horrocks