Filters








7 Hits in 6.3 sec

Page 5706 of Mathematical Reviews Vol. , Issue 89J [page]

1989 Mathematical Reviews  
Neculai Curteanu (R-IASI-SM) 89j:68136 68T15 03B05 03B35 03B70 68T25 Minoux, Michel (F-PARIS6) LTUR: a simplified linear-time unit resolution algorithm for Horn formulae and computer implementation.  ...  The present paper proposes a simplified way of deriving a linear-time algorithm avoiding many of the intricacies of previously known descriptions.  ... 

On Tackling the Limits of Resolution in SAT Solving [chapter]

Alexey Ignatiev, Antonio Morgado, Joao Marques-Silva
2017 Lecture Notes in Computer Science  
Given the new transformation, the paper proves a polynomial bound on the number of MaxSAT resolution steps for pigeonhole formulas.  ...  This paper proposes a new problem transformation, which enables reducing the decision problem for formulas in conjunctive normal form (CNF) to the problem of solving maximum satisfiability over Horn formulas  ...  The decision problem for Horn formulas is well-known to be in P, with linear time algorithms since the 80s [32, 52] .  ... 
doi:10.1007/978-3-319-66263-3_11 fatcat:jrszlcgfxfaxlchwgtc3rd5aqa

On Tackling the Limits of Resolution in SAT Solving [article]

Alexey Ignatiev, Antonio Morgado, Joao Marques-Silva
2017 arXiv   pre-print
Given the new transformation, the paper proves a polynomial bound on the number of MaxSAT resolution steps for pigeonhole formulas.  ...  This paper proposes a new problem transformation, which enables reducing the decision problem for formulas in conjunctive normal form (CNF) to the problem of solving maximum satisfiability over Horn formulas  ...  The decision problem for Horn formulas is well-known to be in P, with linear time algorithms since the 80s [32, 52] .  ... 
arXiv:1705.01477v2 fatcat:mxks6ued2vh3ddi6z6utixo7jq

Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems

M. Minoux, K. Barkaoui
1990 Discrete Applied Mathematics  
The approach presented in this paper thus appears to provide an appropriate framework for addressing algorithmic and computational problems related to Petri net analysis.  ...  In particular, it has already proved to be a powerful tool for solving recognition problems relating to special classes of Petri nets (e.g. proving Commoner's structural property in polynomial time, see  ...  For the problems studied in this paper, as we will see, the Horn-SAT model will appear to be the relevant one, and we will use as a basic tool the linear time unit resolution algorithm (LTUR) described  ... 
doi:10.1016/0166-218x(90)90144-2 fatcat:tvvf6xlvlbgtblbxgqys5atxhe

Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage [chapter]

Christoph Koch
2003 Proceedings 2003 VLDB Conference  
We propose a new, highly scalable and efficient technique for evaluating node-selecting queries on XML trees which is based on recent advances in the theory of tree automata.  ...  The overall running time is O(m + n), where m only depends on the query and n is the size of the data.  ...  Acknowledgments The author is indebted to Wang-Chiew Tan for her XML-ized version of Swissprot. The work was sponsored by Erwin Schrödinger grant J2169 of the Austrian Research Fund (FWF).  ... 
doi:10.1016/b978-012722442-8/50030-6 dblp:conf/vldb/Koch03 fatcat:flsbpjkwhnaxhdymxaot5dmu6m

Page 1132 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
LTUR: a simplified linear-time unit resolution algorithm for Horn formulae and computer implementation. 89j:68136 Mohan, Chilukuri K.  ...  Algorithms with memory for solving problems of the computation of properties. 89d:68077 Kounalis, Emmanvel (with Rusinowitch, Michael) On word problems in Horn theories.  ... 

Page 774 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
Lau) 89e:05159 05C70 (90B10) — LTUR: a simplified linear-time unit resolution algorithm for Horn formulae and computer implementation. /nform. Process. Lett. 29 (1988), no. 1, 1-12.  ...  (with Gondran, Michel) * Graphes et algorithmes. (French) [Graphs and algorithms} Second edition.  ...