Abstract
We study properties characterized by applying successively a “destructive” rule expressed in first-order logic. The rule says that points a 1, ..., a k of a structure can be removed if they satisfy a certain first-order formula ϕ(a 1, ...,a k ). The property defined this way by the formula is the set of finite structures such that we are able to obtain the empty structure when applying the rule repeatedly. Many classical properties can be formulated by means of a “destructive” rule. We do a systematic study of the computational complexity of these properties according to the fragment of first-order logic in which the rule is expressed. We give the list of minimal fragments able to define NP-complete properties and maximal fragments that define only PTIME properties (unless PTIME = NP), depending on the number k of free variables and the quantifier symbols used in the formula. We also study more specifically the case where the formula has one free variable and is universal.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alechina, N., Gurevich, Y.: Syntax vs Semantics on Finite Structures. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol. 1261, pp. 14–33. Springer, Heidelberg (1997)
Duris, D.: Some Characterizations of γ and β-Acyclicity of Hypergraphs (2008), http://hal.archives-ouvertes.fr/hal-00360321/fr/
Ebbinghaus, H.-D., Flum, J., Thomas, W.: Mathematical Logic. Springer, Heidelberg (1994)
Fagin, R.: Degrees of Acyclicity for Hypergraphs and Relational Database Schemes. J. of the ACM 30(3), 514–550 (1983)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Grädel, E., Kreutzer, S.: Will Deflation Lead to Depletion? on Non-Monotone Fixed Point Inductions. In: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS 2003), pp. 158–167 (2003)
Gottlob, G., Kolaitis, G., Schwentick, T.: Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. J. of the ACM 51, 664–674 (2000)
Jungnickel, D.: Graphs, Networks and Algorithms. Springer, Heidelberg (2005)
Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)
Nagl, M.: Graph-Grammatiken: Theorie, Anwendungen, Implementierung. Vieweg (1979)
Tovey, C.A.: A Simplified NP-Complete Satisfiability Problem. Discrete Applied Mathematics 8(1), 85–90 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Duris, D. (2010). Destructive Rule-Based Properties and First-Order Logic. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds) SOFSEM 2010: Theory and Practice of Computer Science. SOFSEM 2010. Lecture Notes in Computer Science, vol 5901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11266-9_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-11266-9_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11265-2
Online ISBN: 978-3-642-11266-9
eBook Packages: Computer ScienceComputer Science (R0)