Sciweavers

111 search results - page 6 / 23
» The eskolemization of universal quantifiers
Sort
View
AI
2008
Springer
13 years 8 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
ECAL
2003
Springer
14 years 1 months ago
A Universal Framework for Self-Replication
Abstract. Self-replication is a fundamental property of many interesting physical, formal and biological systems, such as crystals, waves, automata, and especially forms of natural...
Bryant Adams, Hod Lipson
EACL
1993
ACL Anthology
13 years 9 months ago
The donkey strikes back: Extending the dynamic interpretation "constructively"
The dynamic interpretation of a formula as a binary relation (inducing transitions) on states is extended by alternative treatments of implication, universal quantification, negat...
Tim Fernando
MCS
2008
Springer
13 years 7 months ago
Estimation of cost efficiency of Australian universities
The purpose of this paper is to quantify the efficiency with which Australian universities utilise their teaching resources. The study estimates the cost efficiency of 36 universi...
Jocelyn Horne, Baiding Hu
CINQ
2004
Springer
163views Database» more  CINQ 2004»
14 years 1 months ago
Frequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Ralf Rantzau