See this document in CiteSeerX!

Representing Configuration Knowledge with Weight Constraint Rules (2001)  (Make Corrections)  (4 citations)
Timo Soininen, Ilkka Niemelä



  Home/Search   Context   Related

 
View or download:
saturn.hut.fi/~ini...sntsASP2001.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  saturn.hut.fi/~ini/papers/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The paper demonstrates that product configuration applications fit naturally the framework of answer set programming. It is shown that product configuration knowledge can be represented systematically and compactly using a logic program type rule language such that the answers of a configuration task, the con gurations, correspond to the models of the rule representation. The paper presents such a rule-based formalization of a unified configuration ontology using a weight constraint rule... (Update)

Context of citations to this paper:   More

.... [18] have introduced a notion of weighted logic programs and Niemela s group has separately introduced weighted logic programs [21, 22, 30]. These two frameworks are quite different, even though they have the same name, so we consider them separately. Marek and Trusczynski...

Cited by:   More
Logic Programming with Cardinality Constraints - Syrjänen (2003)   (Correct)
Simplifiying Configuration Through Customer Oriented Product.. - Leckner, Lacher (2003)   (Correct)
Version Spaces and Rule-Based Configuration Management - Syrjänen (2001)   (Correct)

Similar documents (at the sentence level):
8.5%:   Unified Configuration Knowledge Representation.. - Soininen..   (Correct)

Active bibliography (related documents):   More   All
1.1:   Extending and Implementing the Stable Model Semantics - Simons, Niemelä, Soininen (2002)   (Correct)
0.5:   Developing a Declarative Rule Language for Applications in.. - Soininen, Niemelä (1999)   (Correct)
0.5:   Model Construction - For Con Guration   (Correct)

Similar documents based on text:   More   All
0.7:   Stable Model Semantics of Weight Constraint Rules - Niemelä, Simons, Soininen (1999)   (Correct)
0.4:   A Fixpoint Definition of Dynamic Constraint Satisfaction - Soininen, Gelle, Niemelä (1999)   (Correct)

Related documents from co-citation:   More   All
3:   The Stable Model Semantics for Logic Programming - Gelfond - 1988
3:   Extending and implementing the stable model semantics - Simons - 2000
2:   Extending the smodels system with cardinality and weight constraints - Niemel, Patrik - 2000

BibTeX entry:   (Update)

T. Soininen, I. Niemela, J. Tiihonen and R. Sulonen. Representing Configuration Knowledge with Weight Constraint Rules, Proc. AAAI Spring Symp. on Answer Set Programming: Towards Efficient and Scalable Knowledge, March 2001. http://citeseer.ist.psu.edu/soininen01representing.html   More

@misc{ soininen01representing,
  author = "T. Soininen and I. Niemela and J. Tiihonen and R. Sulonen",
  title = "Representing Configuration Knowledge with Weight Constraint Rules",
  text = "Proc. {AAAI} Spring Symp. on Answer
    Set Programming: Towards Efficient and Scalable Knowledge, March 2001.",
  year = "2001",
  url = "citeseer.ist.psu.edu/soininen01representing.html" }
Citations (may not include all citations):
858   The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
104   Dynamic constraint satisfaction problems (context) - Mittal, Falkenhainer - 1990
78   Preferred answer sets for extended logic programs - Brewka, Eiter - 1998
41   An alternative approach to the semantics of disjunctive logi.. (context) - Sakama, Inoue - 1994
35   Strong and weak constraints in disjunctive datalog (context) - Buccafurri, Leone et al. - 1997
33   Developing a declarative rule language for applications in p.. - Soininen, Niemel - 1999
31   Extending the stable model semantics with more expressive ru.. - Simons - 1999
11   Extending the Smodels system with cardinality and weight con.. (context) - Simons - 2000
9   An approach to knowledge representation and reasoning for pr.. (context) - Soininen - 2000
9   Stable model semantics of weight constraint rules (context) - Simons, Soininen - 1999
6   NP-SPEC: An executable specication language for solving all .. - Cadoli, Palopoli et al. - 1999
5   Towards a general ontology of conguration (context) - Soininen, Tiihonen et al. - 1998
4   A xpoint denition of dynamic constraint satisfaction (context) - Soininen, Gelle et al. - 1999
2   A tool for developing interactive conguration applications - Axling, Haridi - 1994
2   Consistencybased conguration (context) - Friedrich, Stumptner - 1999
2   Including diagnostic information in conguration models - anen - 2000
1   Mechanizing shared conguration and diagnosis theories throug.. (context) - Sharma, Colomb - 1998
1   Unied conguration knowledge representation using weight cons.. (context) - Soininen, Niemel et al. - 2000

Documents on the same site (http://saturn.hut.fi/~ini/papers/):   More
A Tableau Calculus for Minimal Model Reasoning - Niemelä (1996)   (Correct)
Implementing Circumscription Using a Tableau Method - Niemelä (1996)   (Correct)
Efficient Implementation of the Well-founded and Stable Model .. - Niemelä, Simons (1996)   (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