Sciweavers

1313 search results - page 202 / 263
» Prioritized Reasoning in Logic Programming
Sort
View
POPL
2012
ACM
13 years 5 months ago
The ins and outs of gradual type inference
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
Aseem Rastogi, Avik Chaudhuri, Basil Hosmer
ICLP
1989
Springer
15 years 1 months ago
Complete and Efficient Methods for Supporting Side-effects in Independent/Restricted AND-Parallelism
It has been shown that it is possible to exploit Independent/Restricted And-parallelism in logic programs while retaining the conventional "don't know" semantics of...
Kalyan Muthukumar, Manuel V. Hermenegildo
AISC
2004
Springer
15 years 3 months ago
Algorithm-Supported Mathematical Theory Exploration: A Personal View and Strategy
Abstract. We present a personal view and strategy for algorithm-supported mathematical theory exploration and draw some conclusions for the desirable functionality of future mathem...
Bruno Buchberger
DLOG
2008
15 years 2 days ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
NMR
2004
Springer
15 years 3 months ago
Frame consistency: computing with causal explanations
This paper presents a computational model for reasoning with causal explanations of observations within the framework of Abductive Event Calculus (AEC). The model is based on abdu...
Andrea Bracciali, Antonis C. Kakas