Sciweavers

144 search results - page 28 / 29
» A Fully Abstract Semantics for a Functional Language with Lo...
Sort
View
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 3 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
ML
2011
ACM
308views Machine Learning» more  ML 2011»
13 years 3 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
IJCAI
2003
13 years 10 months ago
In Defense of PDDL Axioms
There is controversy as to whether explicit support for PDDL-like axioms and derived predicates is needed for planners to handle real-world domains effectively. Many researchers h...
Sylvie Thiébaux, Jörg Hoffmann, Bernha...
AGP
2003
IEEE
14 years 7 days ago
Advanced Backjumping Techniques for Rule Instantiations
Abstract. The interest in the area of non-monotonic reasoning and declarative logic programming is growing rapidly after the recent development of a number of Answer Set Programmin...
Simona Perri, Francesco Scarcello
EMSOFT
2007
Springer
14 years 2 months ago
Proving the absence of run-time errors in safety-critical avionics code
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...
Patrick Cousot