The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 5130 of Mathematical Reviews Vol. , Issue 97H
[page]
1997
Mathematical Reviews
Preserved Fulltext
Summary: “The aim of this paper is to propose linear logic as a proof system allowing one to perform updates of databases containing incomplete information. ...
(F-PARIS11-RI; Orsay)
A linear logic approach to consistency preserving updates. (English summary )
J. Logic Comput. 6 (1996), no. 3, 439-463. ...
Page 5107 of Mathematical Reviews Vol. , Issue 93i
[page]
1993
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The first application is the view update problem: how a fact or its negation can be added or deleted to a database. ...
As a consequence, they are par- ticularly appropriate for solving a variety of combinatorial search problems, using the global search paradigm, with short develop- ment time and efficiency comparable to ...
Page 5762 of Mathematical Reviews Vol. , Issue 2000h
[page]
2000
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We describe the novel class of recursive query answering plans, which enables us to settle three open problems. ...
Summary: “We propose a deductive database model containing two kinds of rules: update rules of the form Ly — L;, where Lo and L, are literals, and query rules in the form of normal logic program rules. ...
Extreme SAT-based Constraint solving with R-Solve
2014
2014 IEEE High Performance Extreme Computing Conference (HPEC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present the architecture of R-Solve, a highperformance constraint solver that extends the gains made in S AT performance over the past fifteen years on static decision problems to problems that require ...
These extensions, which we call Smart Repair, enable R-S olve to address problems in dynamic planning and constrained optimization involving complex logical and arithmetic constraints. ...
or non-linearity in the fitness landscape, problems with deep logical constraints and problems with large infeasible solution regions. ...
doi:10.1109/hpec.2014.8466735
dblp:conf/hpec/EzickSHO14
fatcat:fp7x2jo6jbhv7h2q23lwxdyqqy
Distributed Linear Hashing and Parallel Projection in Main Memory Databases
1990
Very Large Data Bases Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
These extensions are used to implement a parallel projection capability. The performance of distributed linear hashing and parallel projection is investigated. ...
This paper extends the concepts of the distributed linear hashed main memory file system with the objective of supporting higher level parallel dambase operations. ...
To solve the problem of incorrect bucket address computation, retry logic is used. The details of retry logic is described in the next section. ...
dblp:conf/vldb/SeverancePW90
fatcat:u7oqhxplu5gqdekumqv5gk7goq
Page 7274 of Mathematical Reviews Vol. , Issue 98K
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We also provide linear integer programming formulations for solving normaliza- tion decision problems when no special structure is present. ...
Summary: “This paper studies the complexity of the query- answering problem in logic databases with complex values. ...
Page 3649 of Mathematical Reviews Vol. , Issue 95f
[page]
1995
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We also show how the prune-and-search technique coupled with the strategy of replacing a ray by a point or a line can be used to solve, in linear time, the intersection radius problem for a set of n line ...
This is done by reducing the problem to a linear programming problem in a (d + 1)- dimensional space, involving 2n linear constraints. ...
Optimal planning software platform development with cloud computing technology
2012
2012 12th Conference of Open Innovations Association (FRUCT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The Platform uses advanced mathematical models and optimization algorithms developed by IT-park of PetrSU to create services for solving a series of planning tasks for different industries: production ...
The paper describes research and development of software platform for optimal operation planning of pulp-and-paper and forestry enterprises using cloud computing technology. ...
ACKNOWLEDGMENT The article was published with financial support of the Strategic Development Program of Petrozavodsk State University. ...
doi:10.23919/fruct.2012.8122096
dblp:conf/fruct/ShabaevKK12
fatcat:32ssjb5c6jhm3dpap75g6jsljy
Introduction to the 30th International Conference on Logic Programming Special Issue
2014
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The 30th edition of the International Conference of Logic Programming took place in Vienna in July 2014 at the Vienna Summer of Logic - the largest scientific conference in the history of logic. ...
Programming, Inductive Logic Programming, Constraint Logic Programming, Answer-Set Programming; Applications: Databases, Data Integration and Federation, Software Engineering, Natural Language Processing ...
The state-of-the-art in solving DCOPs relies on the use of ad-hoc infrastructures and ad-hoc constraint solving procedures. ...
doi:10.1017/s1471068414000581
fatcat:6fczd6mhxjcutozkk6t23lvn5e
Yices 2.2
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
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.
The first version of Yices was released in 2006 and has been continuously updated since then. ...
We present the tool's architecture and discuss the algorithms it implements, and we describe recent developments such as support for the SMT-LIB 2.0 notation and various performance improvements. ...
Yices also includes two specialized solvers for the difference-logic fragments of linear arithmetic. These two solvers rely on a variant of the Floyd-Warshall algorithm. ...
doi:10.1007/978-3-319-08867-9_49
fatcat:zdfnd2kftve3ll3fsdgjqr4wjm
Page 4205 of Mathematical Reviews Vol. , Issue 99f
[page]
1999
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
informational equivalence of hypernode databases, and thus semi-structured databases, is, in general, undecidable, (2) the problem of determining informational equivalence of flat databases can be solved ...
(RS-AOS-M; Moscow) ;
Spyratos, Nicolas (F-PARIS11-RI; Orsay)
On logically justified updates. (English summary)
Logic programming (Manchester, 1998), 250-264, MIT Press Ser. ...
Page 2051 of Mathematical Reviews Vol. , Issue 2003C
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
to the one used in database systems. ...
Summary: “The computational complexity of finding the minimal real change of a database after an update constrained by a logic program is explored. ...
Tractable Closed World Reasoning with Updates
[chapter]
1994
Principles of Knowledge Representation and Reasoning
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
W e show the method to be both sound and tractable (linear-time updates), and incorporate it into the ucpop planner. ...
Previous work on circumscription, autoepistemic logic, and database theory has explored logical axiomatizations of closed world reasoning, but has not addressed computational tractability. ...
predicates in 8) are used. 3 .5 Information
Discussion The update rules dened above form a sound, linear-time algorithm for updating D M and D C . ...
doi:10.1016/b978-1-4832-1452-8.50113-5
fatcat:ogjkivbr6vb27b6hlgziwguyne
Page 2396 of Mathematical Reviews Vol. , Issue 90D
[page]
1990
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The notions of event and process are modelled.
After an introduction, the static aspects of a system are mod- elled using the many-sorted first-order logic. ...
In this paper the authors prove new lower bounds on the performance of any method for solving two variants of this problem under two different pointer models of computation. ...
Page 1094 of Mathematical Reviews Vol. , Issue 96b
[page]
1996
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A linear size data structure is given for this problem, allowing queries to be solved in O((logn)‘~' loglogn) time, and allowing the four update operations to be performed in O((logn)? ...
Lock, Using constraint logic programming for industrial scheduling problems (273-299).
Part IV. ...
« Previous
Showing results 1 — 15 out of 52,177 results