of a mathematically precise universal language for the expression of arbitrary statements ( characteristica universalis ) is related to the development of a sufficiently general concept of calculus ( calculus ratiocinator ), in which scientific problems can be decided in a purely formal, algorithmic ...
Succinctness as a source of complexity in logical formalisms But whereas several papers study the complexity of specific algorithmic problems on hierarchically defined input graphs, like for instance reachability, planarity... G Gottlob,N Leone,H Veith - 《Annals of Pure & Applied Logic》 被引量...
Total search problems are commonplace in computer science, and studying their complexity is therefore an important endeavour. In this dissertation, we present links between the complexity of solving Q R and the difficulty of proving the totality of Q R in the three logical formalisms: propositional...
A problem of recognizing important properties of propositional calculi is considered, and complexity bounds for some decidable properties are found. For a given logical system L, a property P of logical calculi is called decidable over L if there is an algorithm which for any finite set Ax of...
作者: M Grohe 摘要: Descriptive Complexity Theory studies the complexity of problems of the following type: Given a finite structure A and a sentence φ of some logic L, decide if A satisfies φ? In this survey we discuss DOI: 10.1007/3-540-48168-0_3 被引量: 61 年份: 1999 收藏...
We focus on logical languages based on propositional logic and on the function-free fragment of first-order logic. We show that sub-Boolean and ... G Cozman,Fabio,D Mau��,... - 《International Journal of Approximate Reasoning》 被引量: 5发表: 2017年 On the complexity of propositiona...
The complexity of elementary problems in archimedean ordered groups. Proc. EUROCAL '85 vol. 2 B.F. Caviness (Ed.), Springer Lec. Notes Comp. Sci, 204 (1986), pp. 87-88 Google Scholar Cited by (193) Logical foundations of cyber-physical systems 2018, Logical Foundations of Cyber-Physical...
In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complexity and second-order quantifier elimination techniques.We illustrate the approach on the case of the transversal hypergraph problem, Trans...
The paper is devoted to such general questions as the computability, decidability and complexity of polynomial optimization problems even for integer variables. The first part relates polynomial optimization to Tarski algebra, algorithmical semialgebraic geometry and Matija, sevich's result on diophantine...
Then the complexities of three specific problems: logical compare, sorting and SAT, were analyzed and measured. The result showed SAT was a problem with exponential complexity which naturally leads to the conclusion that no efficient algorithm exists to solve it. That's to say: NP!=P....