2540 search results - page 419 / 508 » Abstract Logics as Dialgebras |
TCAD
2002
13 years 8 months ago
2002
The design of programmable logic architectures and supporting computer-aided design tools fundamentally requires both a good understanding of the combinatorial nature of netlist gr...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. The paper investigates a novel approach, based on Constraint Logic Programming (CLP), to predict the 3D conformation of a protein via fragments assembly. The fragments ar...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract—Accurate and timely identification of the routerlevel topology of the Internet is one of the major unresolved problems in Internet research. Topology recovery via tomog...
JELIA
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...