536 search results - page 33 / 108 » From Formal Concept Analysis to Contextual Logic |
143
click to vote
SAS
2005
Springer
15 years 11 months ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
160
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
Whilst narrative representations have played a prominent role in AI research, there has been a renewed interest in the topic with the development of interactive narratives. A typic...
175
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
In this paper we present an advanced functional extraction tool for automatic generation of high-level RTL from switch-level circuit netlist representation. The tool is called FEV...
159
click to vote
SEMWEB
2007
Springer
16 years 6 days ago
2007
Springer
Several description frameworks to semantically describe and match services on the one hand and service requests on the other have been presented in the literature. Many of the curr...
180
Voted
SYRCODIS
2007
15 years 7 months ago
2007
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...