A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Complexity of n-Queens Completion (Extended Abstract)

2018
*
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence
*

We show that

doi:10.24963/ijcai.2018/794
dblp:conf/ijcai/GentJN18
fatcat:gcfni5n3ibgpncaufi44dx3bs4
*n*-*Queens**Completion*is both NP-*Complete*and #P-*Complete*. A corollary is that any non-attacking arrangement*of**queens*can be included as a part*of*a solution to a larger*n*-*Queens*problem. ... The significance*of*this work is that the*n*-*Queens*problem has been very widely used as a benchmark in Artificial Intelligence, but conclusions on it are often disputable because*of*the simple*complexity*... Acknowledgements We thank Jeff Erickson for raising the question*of*the*complexity**of*(a slight variant*of*)*n*-*Queens**Completion*[Erickson, 2014] and StanislavŽivný for bringing his post to our attention ...##
###
Improving user interaction with spoken dialog systems via shaping

2005
*
CHI '05 extended abstracts on Human factors in computing systems - CHI '05
*

When users interact with the dialog system and speak outside the target language, the system attempts to understand their input and aims to strike a balance between helping them

doi:10.1145/1056808.1056846
dblp:conf/chi/Tomko05
fatcat:dumficbtfjbmnig7kz3vw7g5um
*complete*the current task ... One*of*the most promising applications*of*speech recognition technology is the spoken dialog system, which offers the promise*of*simple, direct, hands-free access to information. ... (*N*= 18). ...##
###
DIY for CHI

2009
*
Proceedings of the 27th international conference extended abstracts on Human factors in computing systems - CHI EA '09
*

*of*DIY Social implications

*of*DIY DIY and education DIY communities DIY and marginalized groups DIY in developing countries ... Topics include but are not limited to: and handiwork Sustainable practices Reuse, repair and economic necessity Open source software Open source hardware Political implications

*of*DIY Economic implications ... In a pinch, you can change babies anywhere you can lay them down, but long term, for the sake

*of*your back, waist height is best. ...

##
###
Extended abstracts of the ESSLLI 2015 workshop TYTLES: Types Theory and Lexical Semantics

2015
unpublished

We aim to

fatcat:mwrrhsiqfnbvfl2hto3hwmloii
*extend*this work by further formalising the known work w.r.t. these calculi, and creating tools to accommodate the writing*of*formal linguistics papers in literate style. ... Acknowledgments The work*of*Justyna Grudzińska was funded by the National Science Center on the basis*of*decision DEC-2012/07/B/HS1/00301. ...*complete*, stands tall. ...##
###
Nondeterministic Control for Hybrid Search

2006
*
Constraints
*

These nondeterministic

doi:10.1007/s10601-006-9005-5
fatcat:jscymw7p4vce7g27zd3ccujiju
*abstractions*describe the search tree and are compiled in terms*of*first-class continuations. ... The*abstractions*are illustrated on a jobshop scheduling algorithm that combines tabu search and a limited form*of*backtracking. ... range R = 1..*n*; 2. int*queen*[R]; 3. function bool search(int[]*queen*,int i) { 4. if (i >*n*) return true; 5. forall(v in R: !attack(*queen*,i,v)) { 6.*queen*[i] = v; 7. ...##
###
Nondeterministic Control for Hybrid Search
[chapter]

2005
*
Lecture Notes in Computer Science
*

These nondeterministic

doi:10.1007/11493853_28
fatcat:7pbrgfikpjdilo6slepu6sa7sq
*abstractions*describe the search tree and are compiled in terms*of*first-class continuations. ... The*abstractions*are illustrated on a jobshop scheduling algorithm that combines tabu search and a limited form*of*backtracking. ... range R = 1..*n*; 2. int*queen*[R]; 3. function bool search(int[]*queen*,int i) { 4. if (i >*n*) return true; 5. forall(v in R: !attack(*queen*,i,v)) { 6.*queen*[i] = v; 7. ...##
###
Monadic constraint programming

2009
*
Journal of functional programming
*

No two

doi:10.1017/s0956796809990086
fatcat:u5lpxlckkbh2fam7udd3vejixa
*queens*share the same column. 2. No two*queens*share the same row. 3. No two*queens*share the same diagonal. A standard model*of*the*n**queens*problem is as follows. ... Since we have*n**queens*to place in*n*different columns, we are sure that there is exactly one*queen*in each column. ... Acknowledgments We are grateful to the anonymous reviewers*of*this paper whose comments and suggestions have significantly improved the presentation as well as Ben Moseley, Serge Le Huitouze, Pieter Wuille ...##
###
Semantic and syntactic issues in programming

1974
*
Bulletin of the American Mathematical Society
*

We will use an

doi:10.1090/s0002-9904-1974-13431-2
fatcat:ppgpsnbgz5cz7j27j4mm6u6uv4
*n*-tuple to represent the sequence*of*positions in which successive*queens*are placed. Initially, no*queens*have been placed, so this is a tuple*of*length 0. ... In summary: we have seen that the family*of*primitive operations available in an*abstract*computer*of*the type that we have con-sidered is readily*extended*. ... Another example*of*current programming research: Nondeterministic programming. Still another active area*of*current work is the search for more general*abstract*machine models, i.e.*of*new ...##
###
Control Abstractions for Local Search

2005
*
Constraints
*

This paper proposes three novel and lightweight control

doi:10.1007/s10601-005-0553-x
fatcat:bmc2ebu4gbfnlj32v3lxknxtje
*abstractions*for the search component, significantly enhancing the compositionality, modularity, and reuse*of*Comet programs. ... They are especially useful for expressing, in a modular way, heuristic and meta-heuristics, unions*of*heterogeneous neighborhoods, and sequential composition*of*neighborhoods. ... . , m*n*, m*n*+1 , . . . , m k s r = m 0 , . . . , m*n*, m*n*+1 , . . . , m l . Fig. 1. The*Queens*Problem in Comet. . selectMin(v in Size)(S.getAssignDelta(*queen*[q],v)) 17.*queen*[q] := v; 18. ...##
###
Control Abstractions for Local Search
[chapter]

2003
*
Lecture Notes in Computer Science
*

This paper proposes three novel and lightweight control

doi:10.1007/978-3-540-45193-8_5
fatcat:t7xa3pcb4ve4rjdoz7sbydolbm
*abstractions*for the search component, significantly enhancing the compositionality, modularity, and reuse*of*Comet programs. ... They are especially useful for expressing, in a modular way, heuristic and meta-heuristics, unions*of*heterogeneous neighborhoods, and sequential composition*of*neighborhoods. ... . , m*n*, m*n*+1 , . . . , m k s r = m 0 , . . . , m*n*, m*n*+1 , . . . , m l . Fig. 1. The*Queens*Problem in Comet. . selectMin(v in Size)(S.getAssignDelta(*queen*[q],v)) 17.*queen*[q] := v; 18. ...##
###
Scala to the Power of Z3: Integrating SMT and Programming
[chapter]

2011
*
Lecture Notes in Computer Science
*

The embedding

doi:10.1007/978-3-642-22438-6_30
fatcat:rgpberf7mrdjle4btwkrnfmrki
*of*formula trees into Scala uses the host type system*of*Scala to prevent the construction*of*certain ill-typed constraints. ... that the values should satisfy instead*of*how to compute them. ... We consider now the problem*of*solving the*N*-*Queens*puzzle: In how many ways can*N**queens*be placed on an*N*×*N*checkerboard such that they do not attack each other? ...##
###
The 1st Verified Software Competition: Experience Report
[chapter]

2011
*
Lecture Notes in Computer Science
*

*Completing*Invert and

*N*

*Queens*required developing quite a bit

*of*theory, which was labor-intensive but possible in VeriFast. ... Aftermath We have now

*completed*all problems. Queue was fairly easy, once the right encoding

*of*sharability was found. (Quantify over the list's fraction, or over each field's fraction separately? ... Problem 4:

*N*

*Queens*. Write and verify a program to place

*N*

*queens*on an

*N*×

*N*chess board so that no

*queen*can capture another one with a legal move. ...

##
###
Verifying Two Lines of C with Why3: An Exercise in Program Verification
[chapter]

2012
*
Lecture Notes in Computer Science
*

This article details the formal verification

doi:10.1007/978-3-642-27705-4_8
fatcat:ety2ftvolfacfoykjlv7y43hfq
*of*a 2-line C program that computes the number*of*solutions to the*n*-*queens*problem. ... The main purpose*of*this article is to illustrate the use*of*Why3 in verifying an algorithmically*complex*program. ... I'm grateful to Andrei Paskevich and Evgeny Makarov for their detailed proofreadings*of*an early version*of*this paper. Finally, I wish to thank the VSTTE reviewers for their helpful comments. ...##
###
DEPICT: A High-Level Formal Language For Modeling Constraint Satisfaction Problems

2006
*
IEEE International Conference on Computer Systems and Applications, 2006.
*

The paper concludes with a description

doi:10.1109/aiccsa.2006.205115
dblp:conf/aiccsa/AbbasTN06
fatcat:d4e4bjvme5djre7dusjvktx67y
*of*a sample run*of*this interpreter showing how a problem modeled as such is typically solved. ... Its use is illustrated through modeling a number*of*benchmark examples. The paper continues with a description*of*a prototype system within which such models may be interpreted. ... The idea*of*providing solver-independent specifications originates from Dr Carmen Gervet. ...##
###
DEPICT: A high-level formal language for modeling constraint satisfaction problems

2008
*
International Journal of Automation and Computing
*

The paper concludes with a description

doi:10.1007/s11633-008-0208-7
fatcat:wwhtgutzgbg4peieyogtkrg5we
*of*a sample run*of*this interpreter showing how a problem modeled as such is typically solved. ... Its use is illustrated through modeling a number*of*benchmark examples. The paper continues with a description*of*a prototype system within which such models may be interpreted. ... The idea*of*providing solver-independent specifications originates from Dr Carmen Gervet. ...
« Previous

*Showing results 1 — 15 out of 20,435 results*