Sciweavers

2225 search results - page 241 / 445
» Logical Structures in the Lexicon
Sort
View
ECCC
2010
92views more  ECCC 2010»
15 years 5 months ago
Logspace Versions of the Theorems of Bodlaender and Courcelle
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
Michael Elberfeld, Andreas Jakoby, Till Tantau
LPAR
2010
Springer
15 years 5 months ago
Labelled Unit Superposition Calculi for Instantiation-Based Reasoning
The Inst-Gen-Eq method is an instantiation-based calculus which is complete for first-order clause logic modulo equality. Its distinctive feature is that it combines first-order ...
Konstantin Korovin, Christoph Sticksel
TCS
2010
15 years 5 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
TGC
2010
Springer
15 years 4 months ago
Symbolic and Analytic Techniques for Resource Analysis of Java Bytecode
Recent work in resource analysis has translated the idea of amortised resource analysis to imperative languages using a program logic that allows mixing of assertions about heap sh...
David Aspinall, Robert Atkey, Kenneth MacKenzie, D...
EUSFLAT
2009
15 years 4 months ago
Information System for the valuation of Universities in Spain
The Spanish National Agency for Quality Assessment and Accreditation as part of its evaluation activities has established a procedure for evaluating both teaching and institutions,...
Maria Socorro García-Cascales, Maria Teresa...