Sciweavers

1743 search results - page 113 / 349
» Generalized Modal Satisfiability
Sort
View
IJCAI
1993
15 years 2 months ago
A Parameterised Module System for Constructing Typed Logic Programs
The paper is concerned with the design of a module system for logic programming so as to satisfy many of the requirements of software en­ gineering. The design is based on the la...
Patricia M. Hill
AI
2007
Springer
15 years 28 days ago
Determining the consistency of partial tree descriptions
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
Manuel Bodirsky, Martin Kutz
86
Voted
AML
2008
66views more  AML 2008»
15 years 28 days ago
Register computations on ordinals
We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounde...
Peter Koepke, Ryan Siders
92
Voted
COR
2010
123views more  COR 2010»
15 years 28 days ago
Multi-dimensional bin packing problems with guillotine constraints
The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while ...
Rasmus Resen Amossen, David Pisinger
91
Voted
DM
2008
91views more  DM 2008»
15 years 27 days ago
An isoperimetric inequality in the universal cover of the punctured plane
We find the largest for which any simple closed path in the universal cover R2 \ Z2 of R2 \ Z2, equipped with the natural lifted metric from the Euclidean two dimensional plane,...
Noga Alon, Adi Pinchasi, Rom Pinchasi