Tommi Syrjänen  Home/Search
Context
Related
| tcs.hut.fi/Publicat...HUTTCSA86.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: tcs.hut.fi/Publications/bibdb/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this work we examine cardinality constraint logic programs. We give a formal definition of the stable model semantics for general cardinality constraint programs and define a syntactic subclass of them, omegarestricted programs, that stays decidable even when function symbols are used. We show that the computational complexity of omega-restricted programs is 2-NEXP-complete in the general case and NEXP-complete if function symbols are not used. We give a general framework for extending the... (Update)
Active bibliography (related documents): More All
1.1: A Rule-Based Formal Model For Software Configuration - Syrjänen (1999) (Correct)
0.7: The DLV System for Knowledge Representation . . . - Leone, Pfeifer, al. (2002) (Correct)
0.6: Extended Semantics and Optimization Algorithms - For Cp-Networks Ronen (Correct)
Similar documents based on text: More All
0.5: A Reachability Analyser for Algebraic System Nets - Mäkelä (2001) (Correct)
0.5: Combining Symbolic and Partial Order Methods for Model Checking.. - Heljanko (2002) (Correct)
0.5: Detecting And Exploiting Data Type Symmetries Of Algebraic.. - Junttila (1999) (Correct)
BibTeX entry: (Update)
@misc{ nen-logic,
author = "Tommi Syrjänen",
title = "Logic Programming with Cardinality Constraints",
url = "citeseer.ist.psu.edu/691122.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
951 Computational Complexity (context) - Papadimitriou - 1994
858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
850 A logic for default reasoning (context) - Reiter - 1980
509 Introduction to Lattices and Order (context) - Davey, Priestley - 1990
374 Classical negation in logic programs and disjunctive databas.. - Gelfond, Lifschitz - 1991
270 Logic programs with classical negation (context) - Gelfond, Lifschitz - 1990
259 Elements of the Theory of Computation (context) - Lewis, Papadimitriou - 1998
234 The well-founded semantics for general logic programs - Van Gelder, Ross et al. - 1991
180 Logic programming and negation: A survey - Apt, Bol - 1994
162 The semantics of predicate logic as a programming language (context) - van Emden, Kowalski - 1976
120 Stable semantics for disjunctive programs - Przymusinski - 1991
91 Splitting a logic program - Lifschitz, Turner - 1994
91 Propositional circumscription and extended closed-world reas.. - Eiter, Gottlob - 1993
90 Stable models and an alternative logic programming paradigm - Marek, nski
90 Stable models and an alternative logic programming paradigm - Marek, nski - 1999
84 The kr system dlv: Progress report (context) - Eiter, Leone et al. - 1998
78 Preferred answer sets for extended logic programs - Brewka, Eiter - 1999
75 Complexity and expressive power of logic programming - Dantsin, Eiter et al. - 2001
68 Extending and implementing the stable model semantics - Simons, Niemel et al. - 2002
68 Extending and implementing the stable model semantics - Simons - 2000
65 Answer set planning - Lifschitz - 1999
55 Well-founded semantics for extended logic programs with dyna.. - Brewka - 1996
55 Nonmonotonic Logic (context) - Marek, nski - 1993
54 Encoding planning problems in nonmonotonic logic programs - Dimopoulos, Nebel et al. - 1997
53 ACMTransactions on Database Systems (context) - Eiter, Gottlob et al. - 1997
51 Adding priorities and specificity to default logic (context) - Brewka - 1994
47 Using logic programs with stable model semantics to solve de.. - Heljanko - 1999
46 Logic programs with stable model semantics as a constraint p.. (context) - Niemel - 1999
46 Logic programs with stable model semantics as a constraint p.. (context) - Niemel - 1998
41 An alternative approach to the semantics of disjunctive logi.. (context) - Sakama, Inoue - 1994
39 Reasoning with prioritized defaults - Gelfond, Son - 1998
35 Strong and weak constraints in disjunctive datalog (context) - Buccafurri, Leone et al. - 1997
34 Stationary semantics for disjunctive logic programs (context) - Przymusinski - 1990
33 Developing a declarative rule language for applications in p.. - Soininen, Niemel - 1999
31 Answer set programming and plan generation - Lifschitz - 2002
31 Extending the stable model semantics with more expressive ru.. - Simons - 1999
31 Smodels -- an implementation of the stable model and well-fo.. (context) - Niemel, Simons - 1997
29 Default reasoning system DeReS (context) - nski, Marek et al. - 1996
26 Unfolding partiality and disjunctions in stable model semant.. - Janhunen, Niemel et al. - 2000
25 ASSAT: Computing answer sets of a logic program by SAT solve.. (context) - Lin, Zhao - 2002
24 Extending the smodels system with cardinality and weight con.. - Niemel, Simons - 2000
24 Logic programs with compiled preferences - Delgrande, Schaub et al. - 2000
24 Towards constraint satisfaction through logic programs and t.. - Simons - 1997
22 Prioritizing default logic - Brewka, Eiter - 2000
18 Logic programming with ordered disjunction - Brewka - 2002
16 Using database optimization techniques for nonmonotonic reas.. - Faber, Leone et al. - 1999
14 Lexicographic priorities in default logic - Rintanen - 1998
14 Prioritized logic programming and its application to commons.. - Sakama, Inoue - 2000
14 A comparative study of logic programs with preference - Schaub, Wang - 2001
12 Implementing ordered disjunction using answer set solvers fo.. - Brewka, Niemel et al. - 2002
11 Journal of the Association for Computing Machinery (context) - Marek, nski et al. - 1991
10 Efficient implementation of the wellfounded and stable model.. (context) - Niemel, Simons - 1996
9 An Approach to Knowledge Representation and Reasoning for Pr.. (context) - Soininen - 2000
9 Computing preferred answer sets by meta-interpretation in an.. - Eiter, Faber et al. - 2002
8 Improving asp instantiators by join-ordering methods (context) - Leone, Perri et al. - 2001
7 Propositional satisfiability in answer-set programming - East, nski - 2001
6 On logic programs with cardinality constraints (context) - Marek, Remmel - 2002
6 Comparing the expressive powers of some syntactically restri.. - Janhunen - 2000
5 Stable model semantics of weight constraint rules (context) - Niemel, Simons et al. - 1999
4 Mathematical Puzzles of Sam Loyd (context) - Loyd - 1959
4 Representing configuration knowledge with weight constraint .. - Soininen, Niemel et al. - 2001
3 Implementation of local grounding for logic programs with st.. (context) - Syrjnen - 1998
3 Lexicographic Ordering as a Basis of Priorities in Default R.. (context) - Rintanen - 1997
3 the foundations of answer set programming (context) - Marek, Remmel - 2001
3 Nomore : A system for nonmonotonic reasoning under answer se.. (context) - Anger, Konczak et al. - 2001
2 Set constraints in logic programming (context) - Marek, Remmel - 2002
2 System description: Dlv (context) - Dell'Armi, Faber et al. - 2001
2 Formalizing configuration knowledge using rules with choices - Soininen, Niemel - 1998
1 Resoning with infinite stable models (context) - Bonatti - 2001
1 Modelling the game of life using logic programs (context) - Syrjnen - 2000
1 Optimizing configurations (context) - Syrjnen - 2000
1 Omega-restricted logic programs (context) - Syrjnen - 2001
1 Cmodels-2: SAT-based answer set solver enhanced to non-tight.. (context) - Babovich, Maratea - 2004
1 Version spaces and rule-based configuration management (context) - Syrjnen - 2001
1 A rule-based formal model of software configuration (context) - Syrjnen - 1999
1 The smodels system (context) - Syrjnen, Niemel - 2001
1 Including diagnostic information in configuration models (context) - Syrjnen - 2000
http://www.tcs.hut.fi/Software/smodels>
Documents on the same site (http://www.tcs.hut.fi/Publications/bibdb/): More
A Reachability Analyser for Algebraic System Nets - Mäkelä (2001) (Correct)
Sets In Abelian Groups With Distinct Sums Of Pairs - Haanpää, Östergård (2004) (Correct)
Detecting And Exploiting Data Type Symmetries Of Algebraic.. - Junttila (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC