Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    The aditi deductive database system (1994)
    Springer
    The VLDB journal 3 (1994), S. 245-288 
    Details
    ISSN: 0949-877X
    Keywords: Logic ; implementation ; multi-user ; parallelism ; relational database
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Deductive databases generalize relational databases by providing support for recursive views and non-atomic data. Aditi is a deductive system based on the client-server model; it is inherently multi-user and capable of exploiting parallelism on shared-memory multiprocessors. The back-end uses relational technology for efficiency in the management of disk-based data and uses optimization algorithms especially developed for the bottom-up evaluation of logical queries involving recursion. The front-end interacts with the user in a logical language that has more expressive power than relational query languages. We present the structure of Aditi, discuss its components in some detail, and present performance figures.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01228882
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    CLP(ℜ) and some electrical engineering problems (1992)
    Springer
    Journal of automated reasoning 9 (1992), S. 231-260 
    Details
    ISSN: 1573-0670
    Keywords: Constraints ; logic programming ; circuit analysis ; circuit synthesis ; field analysis ; signal flow analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The Constraint Logic Programming Scheme defines a class of languages designed for programming with constraints using a logic programming approach. These languages are soundly based on a unified framework of formal semantics. In particular, as an instance of this scheme with real arithmetic constraints, the CLP(ℜ) language facilitates and encourages a concise and declarative style of programming for problems involving a mix of numeric and non-numeric computation. In this paper we illustrate the practical applicability of CLP(ℜ) with examples of programs to solve electrical engineering problems. This field is particularly rich in problems that are complex and largely numeric, enabling us to demonstrate a number of the unique features of CLP(ℜ). A detailed look at some of the more important programming techniques highlights the ability of CLP(ℜ) to support well-known, powerful techniques from constraint programming. Our thesis is that CLP(ℜ) is an embodiment of these techniques in a language that is more general, elegant and versatile than the earlier languages, and yet is practical.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00245462
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Introduction to the Special Issue on Constraints and Databases (1997)
    Springer
    Constraints 2 (1997), S. 243-243 
    Details
    ISSN: 1572-9354
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009702011844
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    An Efficient Evaluation Technique for Non-Stratified Programs by Transformation to Explicitly Locally Stratified Programs (1997)
    Springer
    Journal of systems integration 7 (1997), S. 191-230 
    Details
    ISSN: 1573-8787
    Keywords: explicitly locally stratified ; deductive databases ; logic programming ; magic sets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We give a simple transformation from normal programs with no stratification (local, weak, modular, etc.) into a subclass of the locally stratified programs, called Explicitly Locally Stratified (ELS) programs, for which there are efficient evaluation techniques. One set of predicates are generated for the true tuples and a different set of predicate are generated for the true and undefined tuples. A similar transformation is given that incorporates a magic sets like transformation. Previous approaches to magic sets transformations of unstratified programs either restricted the class of sips used or generated a program that required special treatment of the magic sets predicates. Our transformation does not suffer from these flaws.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008275219746
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    On inductive inference of cyclic structures (1995)
    Springer
    Annals of mathematics and artificial intelligence 15 (1995), S. 167-208 
    Details
    ISSN: 1573-7470
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We examine the problem of inductive inference in the domain of pointer-based data structures. We show how these data structures can be formalized as rational trees. Our main technical results concern the expressiveness of a language of rational term expressions. These results place limitations on techniques of inductive inference for this description language. The results are also relevant to implementation of negation in logic programming languages.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01534454
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Book
    Book
    Programming with constraints : an introduction (1998)
    Cambridge, MA u.a. :MIT Press,
    Details
    Title: Programming with constraints : an introduction
    Author: Marriott,, Kim
    Contributer: Stuckey, Peter J.
    Publisher: Cambridge, MA u.a. :MIT Press,
    Year of publication: 1998
    Pages: 467 S.
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
  • 7
    facet.materialart.
    Unknown
    Rapid Learning for Binary Programs (2010)
    Details
    Publication Date: 2022-03-14
    Description: Learning during search allows solvers for discrete optimization problems to remember parts of the search that they have already performed and avoid revisiting redundant parts. Learning approaches pioneered by the SAT and CP communities have been successfully incorporated into the SCIP constraint integer programming platform. In this paper we show that performing a heuristic constraint programming search during root node processing of a binary program can rapidly learn useful nogoods, bound changes, primal solutions, and branching statistics that improve the remaining IP search.
    Keywords: ddc:510
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 8
    facet.materialart.
    Unknown
    Rapid Learning for Binary Programs (2010)
    Details
    Publication Date: 2022-03-14
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 9
    facet.materialart.
    Unknown
    Local Rapid Learning for Integer Programs (2018)
    Details
    Publication Date: 2024-01-12
    Description: Conflict learning algorithms are an important component of modern MIP and CP solvers. But strong conflict information is typically gained by depth-first search. While this is the natural mode for CP solving, it is not for MIP solving. Rapid Learning is a hybrid CP/MIP approach where CP search is applied at the root to learn information to support the remaining MIP solve. This has been demonstrated to be beneficial for binary programs. In this paper, we extend the idea of Rapid Learning to integer programs, where not all variables are restricted to the domain {0, 1}, and rather than just running a rapid CP search at the root, we will apply it repeatedly at local search nodes within the MIP search tree. To do so efficiently, we present six heuristic criteria to predict the chance for local Rapid Learning to be successful. Our computational experiments indicate that our extended Rapid Learning algorithm significantly speeds up MIP search and is particularly beneficial on highly dual degenerate problems.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 10
    facet.materialart.
    Unknown
    Local Rapid Learning for Integer Programs (2019)
    Details
    Publication Date: 2024-01-12
    Description: Conflict learning algorithms are an important component of modern MIP and CP solvers. But strong conflict information is typically gained by depth-first search. While this is the natural mode for CP solving, it is not for MIP solving. Rapid Learning is a hybrid CP/MIP approach where CP search is applied at the root to learn information to support the remaining MIP solve. This has been demonstrated to be beneficial for binary programs. In this paper, we extend the idea of Rapid Learning to integer programs, where not all variables are restricted to the domain {0, 1}, and rather than just running a rapid CP search at the root, we will apply it repeatedly at local search nodes within the MIP search tree. To do so efficiently, we present six heuristic criteria to predict the chance for local Rapid Learning to be successful. Our computational experiments indicate that our extended Rapid Learning algorithm significantly speeds up MIP search and is particularly beneficial on highly dual degenerate problems.
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...