Solving satisfiability and implication problems in database systems

被引：0
|
作者：
Florida Int Univ, Miami, United States [1 ]
机构：
来源：
ACM Trans Database Syst | / 2卷 / 270-293期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] An Approximative Inference Method for Solving ∃∀SO Satisfiability Problems
    Vlaeminck, Hanne
    Wittocx, Johan
    Vennekens, Joost
    Denecker, Marc
    Bruynooghe, Maurice
    LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2010, 2010, 6341 : 326 - 338
  • [22] Trap escaping strategies in discrete Lagrangian methods for solving hard satisfiability and maximum satisfiability problems
    Wu, Z
    Wah, BW
    SIXTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-99)/ELEVENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE (IAAI-99), 1999, : 673 - 678
  • [23] Trap escaping strategies in discrete Lagrangian methods for solving hard satisfiability and maximum satisfiability problems
    Wu, Zhe
    Wah, Benjamin W.
    Proceedings of the National Conference on Artificial Intelligence, 1999, : 673 - 678
  • [24] Solving disjunctive temporal problems with preferences using maximum satisfiability
    Maratea, Marco
    Pulina, Luca
    AI COMMUNICATIONS, 2012, 25 (02) : 137 - 156
  • [25] GridSAT: a system for solving satisfiability problems using a computational grid
    Chrabakh, Wahid
    Wolski, Rich
    PARALLEL COMPUTING, 2006, 32 (09) : 660 - 687
  • [26] Solving satisfiability problems using logic synthesis and reconfigurable hardware
    Suyama, T
    Yokoo, M
    Sawada, H
    PROCEEDINGS OF THE THIRTY-FIRST HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, VOL VII: SOFTWARE TECHNOLOGY TRACK, 1998, : 179 - 186
  • [27] Solving satisfiability problems by the ground-state quantum computer
    Mao, WJ
    PHYSICAL REVIEW A, 2005, 72 (05):
  • [28] Solving Boolean satisfiability problems with resistive content addressable memories
    Giacomo Pedretti
    Fabian Böhm
    Tinish Bhattacharya
    Arne Heittmann
    Xiangyi Zhang
    Mohammad Hizzani
    George Hutchinson
    Dongseok Kwon
    John Moon
    Elisabetta Valiante
    Ignacio Rozada
    Catherine E. Graves
    Jim Ignowski
    Masoud Mohseni
    John Paul Strachan
    Dmitri Strukov
    Ray Beausoleil
    Thomas Van Vaerenbergh
    npj Unconventional Computing, 2 (1):
  • [29] Solving satisfiability problems on FPGAs using experimental unit propagation
    Suyama, T
    Yokoo, M
    Nagoya, A
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING-CP'99, 1999, 1713 : 434 - 445
  • [30] An average case analysis of the branching algorithm for solving κ-satisfiability problems
    Tsai, YT
    Tang, CY
    PROCEEDINGS OF THE 4TH AUSTRALASIAN THEORY SYMPOSIUM, CATS'98, 1998, 20 (03): : 137 - 150
12345