scholarly journals Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols

2017 ◽  
Vol 18 (4) ◽  
pp. 1-42 ◽  
Author(s):  
Marco Calautti ◽  
Sergio Greco ◽  
Irina Trubitsyna
Keyword(s):  
Logic Programs ◽  
Decidable Classes

scholarly journals Polynomial and Exponential Bounded Logic Programs with Function Symbols: Some New Decidable Classes

2019 ◽  
Vol 64 ◽  
pp. 749-815
Author(s):  
Vernon Asuncion ◽  
Yan Zhang ◽  
Heng Zhang ◽  
Ruixuan Li
Keyword(s):  
Propositional Logic ◽  
Logic Program ◽  
Logic Programs ◽  
Decidable Classes ◽  
Stable Models

A logic program with function symbols is called finitely ground if there is a finite propositional logic program whose stable models are exactly the same as the stable models of this program. Finite groundability is an important property for logic programs with function symbols because it makes feasible to compute such programs' stable models using traditional ASP solvers. In this paper, we introduce new decidable classes of finitely ground programs called poly-bounded and k-EXP-bounded programs, which, to the best of our knowledge, strictly contain all other decidable classes of finitely ground programs discovered so far in the literature. We also study the relevant complexity properties for these classes of programs. We prove that the membership complexities for poly-bounded and k-EXP-bounded programs are EXPTIME-complete and (k+1)-EXPTIME-complete, respectively.

Generalized Disjunctive Well-Founded Semantics for Logic Programs

1990 ◽  
Author(s):  
Chitta Baral ◽  
Jorge Lobo ◽  
Jack Minker
Keyword(s):  
Logic Programs

Logical Decision Problems and Complexity of Logic Programs

1987 ◽  
Vol 10 (1) ◽  
pp. 1-33
Author(s):  
Egon Börger ◽  
Ulrich Löwen
Keyword(s):  
Fixed Point ◽  
Computational Complexity ◽  
Decision Problem ◽  
Decision Problems ◽  
Complexity Classes ◽  
Logic Programs ◽  
Finite Structures ◽  
Syntactic Restrictions

We survey and give new results on logical characterizations of complexity classes in terms of the computational complexity of decision problems of various classes of logical formulas. There are two main approaches to obtain such results: The first approach yields logical descriptions of complexity classes by semantic restrictions (to e.g. finite structures) together with syntactic enrichment of logic by new expressive means (like e.g. fixed point operators). The second approach characterizes complexity classes by (the decision problem of) classes of formulas determined by purely syntactic restrictions on the formation of formulas.

Y-Logic: A Framework for Reasoning About Chameleonic Programs with Inconsistent Completions

1990 ◽  
Vol 13 (4) ◽  
pp. 465-483
Author(s):  
V.S. Subrahmanian
Keyword(s):  
Classical Logic ◽  
Logic Program ◽  
Logic Programs ◽  
Large Subset ◽  
General Logic ◽  
Traditional Sense

Large logic programs are normally designed by teams of individuals, each of whom designs a subprogram. While each of these subprograms may have consistent completions, the logic program obtained by taking the union of these subprograms may not. However, the resulting program still serves a useful purpose, for a (possibly) very large subset of it still has a consistent completion. We argue that “small” inconsistencies may cause a logic program to have no models (in the traditional sense), even though it still serves some useful purpose. A semantics is developed in this paper for general logic programs which ascribes a very reasonable meaning to general logic programs irrespective of whether they have consistent (in the classical logic sense) completions.

scholarly journals Logic programs with propositional connectives and aggregates

2011 ◽  
Vol 12 (4) ◽  
pp. 1-40 ◽  
Author(s):  
Paolo Ferraris
Keyword(s):  
Logic Programs

Path dependent analysis of logic programs

2002 ◽  
Vol 37 (3) ◽  
pp. 63-74
Author(s):  
Lunjin Lu
Keyword(s):  
Logic Programs ◽  
Path Dependent

scholarly journals Syntax-Preserving Belief Change Operators for Logic Programs

2018 ◽  
Vol 19 (2) ◽  
pp. 1-42
Author(s):  
Sebastian Binnewies ◽  
Zhiqiang Zhuang ◽  
Kewen Wang ◽  
Bela Stantic
Keyword(s):  
Belief Change ◽  
Logic Programs

Executing Temporal Logic Programs by Ben Moszkowski

1986 ◽  
pp. 15
Author(s):  
Wiktor Marck
Keyword(s):  
Temporal Logic ◽  
Logic Programs

scholarly journals Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs

2010 ◽  
Vol 174 (16-17) ◽  
pp. 1285-1306 ◽  
Author(s):  
Miroslaw Truszczyński
Keyword(s):  
Logic Programs ◽  
Semantics Of Logic Programs
Sign in / Sign up

Export Citation Format

Share Document