Sciweavers

1631 search results - page 45 / 327
» Observing Functional Logic Computations
Sort
View
AUSAI
2006
Springer
14 years 1 months ago
Logical Properties of Belief-Revision-Based Bargaining Solution
This paper explores logical properties of belief-revision-based bargaining solution. We first present a syntax-independent construction of bargaining solution based on prioritized ...
Dongmo Zhang, Yan Zhang
TIM
2010
79views Education» more  TIM 2010»
13 years 4 months ago
Desired Order Continuous Polynomial Time Window Functions for Harmonic Analysis
Abstract--An approach for the construction of a family of desired order continuous polynomial time window functions is presented without self-convolution of the parent window. The ...
P. Singla, T. Singh
LISP
2008
96views more  LISP 2008»
13 years 10 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
AIEDAM
1999
157views more  AIEDAM 1999»
13 years 9 months ago
Representing a robotic domain using temporal description logics
A temporal logic for representing and reasoning on a robotic domain is presented. Actions are represented by describing what is true while the action itself is occurring, and plan...
Alessandro Artale, Enrico Franconi
LICS
2002
IEEE
14 years 2 months ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson