Filters








12,222 Hits in 6.9 sec

Constraint Satisfaction Problems in Non-deterministic Logarithmic Space [chapter]

Víctor Dalmau
2002 Lecture Notes in Computer Science  
This concept is motivated by the fact that a CSP with bounded linear width falls into the class NL of problems solvable in non-deterministic logarithmic space.  ...  In this talk we want to focus on a different variant of consistency which was introduced, in the context of logic, via definability by linear datalog programs, leading to the notion of linear width.  ...  This concept is motivated by the fact that a CSP with bounded linear width falls into the class NL of problems solvable in non-deterministic logarithmic space.  ... 
doi:10.1007/3-540-45465-9_36 fatcat:wlxiksjxu5eitkyohurasq5gfy

Page 5581 of Mathematical Reviews Vol. , Issue 96i [page]

1996 Mathematical Reviews  
For fixed k, the problems of interest are solvable optimally in linear time on k-outerplanar graphs by dynamic programming.  ...  Linear logic was introduced by Girard as a resource-sensitive refinement of classical logic. The guarded commands approach to non-deterministic and parallel programming was introduced by Dijkstra.  ... 

Book Review: The decision problem: Solvable classes of quantificational formulas

Yuri Gurevich
1982 Bulletin of the American Mathematical Society  
Unsolvable classes of quantificational formulas, by Harry R. Lewis, Addison-Wesley, Reading, Mass., 1979, xv + 198 pp., $13.50. What is the decision problem in question?  ...  The original problem was to find an algorithm deciding logical validity of sentences of the usual first-order logic.  ...  known by 1979, on prefix-similarity-Krom classes, on prefix-similarity-Horn classes, and on a couple of other programs.  ... 
doi:10.1090/s0273-0979-1982-15033-9 fatcat:tw3fcc3psfbnpd6eej2j3qizty

Knowledge-Based Linear Programming

O. L. Mangasarian
2005 SIAM Journal on Optimization  
We introduce a class of linear programs with constraints in the form of implications.  ...  The overall problem can be viewed either as a semi-infinite linear program or as a linear program with equilibrium constraints which, in either case, can be solved by an equivalent simple linear program  ...  Hx ≥ h, (20) is solvable, then KBLP (1) is solvable. Proof The dual of the underlying linear program (20) is: max t h t s.t.  ... 
doi:10.1137/s1052623403432839 fatcat:vq2mcitlovaoneg5i4s36kxl3m

Page 5547 of Mathematical Reviews Vol. , Issue 95i [page]

1995 Mathematical Reviews  
Finding a complete system that does not coincide with the set of all pairs of equivalent schemes of a given class is the problem of e.t. in this class.  ...  We prove that in such models the problem of e.t. is solvable.”  ... 

Page 7834 of Mathematical Reviews Vol. , Issue 2003j [page]

2003 Mathematical Reviews  
We build upon the class of program schemes NSPQ(1) an infinite hierarchy of classes of program schemes and show that the class of problems accepted by these program schemes has a zero-one law and consists  ...  The class of problems accepted when access to the numerical universe is removed is exactly the class of recursively solvable problems that are closed under ex- tensions.  ... 

Page 2085 of Mathematical Reviews Vol. 53, Issue 6 [page]

1977 Mathematical Reviews  
There are many pattern recognition problems in which the learn- ing process can be reduced to the “decipherment” of a monotone function of a many-valued logic.  ...  Finally, he examines a problem reducible to the “decipherment” of mono- tone functions of many-valued logics. Janos Demetrovics (Budapest) Batchelor, B. G.; Hand, D.  ... 

Page 2591 of Mathematical Reviews Vol. 57, Issue 6 [page]

1979 Mathematical Reviews  
Tiling Problems. Linear Sampling Problem, First Version. Other Versions of the Linear Sampling Problem. Unconstrained Tiling Problems. Miscellaneous Problems.  ...  Addison-Wesley Advanced Book Pro THE DECISION PROBLEM: Solvable Classes of Quantificational Formulas Burton Dreben and Warren D.  ... 

Is Polynomial Time Choiceless? [chapter]

Erich Grädel, Martin Grohe
2015 Lecture Notes in Computer Science  
A long time ago, Yuri Gurevich made precise the problem of whether there is a logic capturing polynomial-time on arbitrary finite structures, and conjectured that no such logic exists.  ...  Nevertheless, together with Andreas Blass and Saharon Shelah, he has also proposed what still seems to be the most promising candidate for a logic for polynomial time, namely Choiceless Polynomial Time  ...  Linear Algebra. The second class of hard problems for FPC includes queries from linear algebra.  ... 
doi:10.1007/978-3-319-23534-9_11 fatcat:n6rczztse5g4nezyzahgrmis3q

Definability of linear equation systems over groups and rings

Anuj Dawar, Eryk Kopczynski, Bjarki Holm, Erich Grädel, Wied Pakusa, Arnaud Durand
2013 Logical Methods in Computer Science  
Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear  ...  Moreover, we prove closure properties for classes of queries that reduce to solvability over rings, which provides normal forms for logics extended with solvability operators.  ...  ('solvability problems') over any class of (finite) groups or rings.  ... 
doi:10.2168/lmcs-9(4:12)2013 fatcat:miw5iydrhjd5plmirn2yz6zv54

Page 5320 of Mathematical Reviews Vol. , Issue 87i [page]

1987 Mathematical Reviews  
in branch and bound algorithms, it appears as a constructive scheme for proof of the polynomial solvability of new classes of AP and extension of the known polynomially solvable special cases of AP.”  ...  Jiirgen Kohler (Halle) Cabot, A. Victor (1-IN); Erenguc, S. Selcuk (1-FL) A branch and bound algorithm for solving a class of nonlinear integer programming problems. Naval Res. Logist.  ... 

Querying constraints

Jean-Louis Lassez
1990 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '90  
We show how one can design a querying system for sets of linear constraints by using basic concepts from logic programming and symbolic computation, as well as algorithms from linear programming and computational  ...  The design of languages to tackle constraint satisfaction problems has a long history.  ...  Essentially we formulate the solvability problem in a variant of duality in linear programming.  ... 
doi:10.1145/298514.298581 dblp:conf/pods/Lassez90 fatcat:2t3mosyfffdoffimr3co552og4

Page 3596 of Mathematical Reviews Vol. , Issue 90F [page]

1990 Mathematical Reviews  
In this paper it is shown that some basic problems involving solvable and nilpotent finite permutation groups are in the class NC, which can be described informally as the class of problems solvable in  ...  . (3) Replace any product, one of whose inputs is known, by a linear transformation.  ... 

Solving Constrained Horn Clauses Using Dependence-Disjoint Expansions

Qi Zhou, David Heath, William Harris
2018 Electronic Proceedings in Theoretical Computer Science  
Recursion-free Constrained Horn Clauses (CHCs) are logic-programming problems that can model safety properties of programs with bounded iteration and recursion.  ...  The advantage of this class is that many CDD systems are smaller than systems which express the same constraints but are part of a different class.  ...  Introduction Many critical problems in program verification can be reduced to solving systems of Constrained Horn Clauses (CHCs), a class of logic-programming problems [4, 5, 20, 21] .  ... 
doi:10.4204/eptcs.278.3 fatcat:hvc5oimwqvgezd2ssmmvzcbkrq

Page 2937 of Mathematical Reviews Vol. , Issue 83h [page]

1983 Mathematical Reviews  
G. 83g:68026 On the solvability of the problem of construction of a complete sample system for a class of programs. (Russian. Armenian summary) Akad. Nauk Armyan. SSR Dokl. 72 (1981), no. 3, 151-156.  ...  Author’s summary: “A method for proving the existence of a solution of a problem is presented for a class of computational problems.  ... 
« Previous Showing results 1 — 15 out of 12,222 results