Sciweavers

191 search results - page 16 / 39
» Mappings Between Domain Models in Answer Set Programming
Sort
View
ASP
2003
Springer
15 years 2 months ago
Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning system
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
Robert E. Mercer, Vincent Risch
IFM
2007
Springer
126views Formal Methods» more  IFM 2007»
15 years 3 months ago
Common Semantics for Use Cases and Task Models
In this paper, we introduce a common semantic framework for developing and formally modeling use cases and task models. Use cases are the notation of choice for functional require...
Daniel Sinnig, Patrice Chalin, Ferhat Khendek
ASE
1998
81views more  ASE 1998»
14 years 9 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang
DKE
2002
137views more  DKE 2002»
14 years 9 months ago
Reasoning for Web document associations and its applications in site map construction
Recently, there is an interest in using associations between web pages in providing users with pages relevant to what they are currently viewing. We believe that, to enable intell...
K. Selçuk Candan, Wen-Syan Li
BMCBI
2006
130views more  BMCBI 2006»
14 years 9 months ago
Docking protein domains in contact space
Background: Many biological processes involve the physical interaction between protein domains. Understanding these functional associations requires knowledge of the molecular str...
Stefano Lise, Alice Walker-Taylor, David T. Jones