Sciweavers

620 search results - page 85 / 124
» About the logical relations between cases and rules
Sort
View
CIE
2007
Springer
15 years 6 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
KBSE
2000
IEEE
15 years 3 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
SIGSOFT
2007
ACM
16 years 19 days ago
Mining API patterns as partial orders from source code: from usage scenarios to specifications
A software system interacts with third-party libraries through various APIs. Using these library APIs often needs to follow certain usage patterns. Furthermore, ordering rules (sp...
Mithun Acharya, Tao Xie, Jian Pei, Jun Xu
81
Voted
CORR
2010
Springer
102views Education» more  CORR 2010»
14 years 11 months ago
On Factor Universality in Symbolic Spaces
The study of factoring relations between subshifts or cellular automata is central in symbolic dynamics. Besides, a notion of intrinsic universality for cellular automata based on ...
Laurent Boyer, Guillaume Theyssier
115
Voted
COOPIS
2002
IEEE
15 years 4 months ago
Formal Ontology Engineering in the DOGMA Approach
This paper presents a specifically database-inspired approach (called DOGMA) for engineering formal ontologies, implemented as shared resources used to express agreed formal semant...
Mustafa Jarrar, Robert Meersman