Querying Formal Contexts with Answer Set Programs
暂无分享,去创建一个
[1] Johann Blieberger,et al. Real-Time Properties of Indirect Recursive Procedures , 2002, Inf. Comput..
[2] G. Plotkin. Tω as a Universal Domain , 1978 .
[3] Pascal Hitzler,et al. Default Reasoning over Domains and Concept Hierarchies , 2004, KI.
[4] Samson Abramsky,et al. Domain theory , 1995, LICS 1995.
[5] V. Rich. Personal communication , 1989, Nature.
[6] Bernhard Ganter,et al. Using Conceptual Structures: Contributions to ICCS 2003 , 2003 .
[7] Melvin Fitting,et al. A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..
[8] Günther Palm,et al. KI 2004: Advances in Artificial Intelligence , 2004, Lecture Notes in Computer Science.
[9] Deborah L. McGuinness,et al. Owl web ontology language guide , 2003 .
[10] Bernhard Ganter,et al. Formal Concept Analysis: Mathematical Foundations , 1998 .
[11] Guo-Qiang Zhang,et al. Clausal Logic and Logic Programming in Algebraic Domains , 2001, Inf. Comput..
[12] David Makinson,et al. Bridges between Classical and Nonmonotonic Logic , 2003, Log. J. IGPL.
[13] Samson Abramsky,et al. Handbook of logic in computer science. , 1992 .
[14] Hans Tompits,et al. A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming , 2005, IJCAI.
[15] Timo Soininen,et al. Extending and implementing the stable model semantics , 2000, Artif. Intell..
[16] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..
[17] Gerald Pfeifer,et al. A Deductive System for Non-Monotonic Reasoning , 1997, LPNMR.
[18] Pascal Hitzler,et al. Formal Concept Analysis and Resolution in Algebraic Domains , 2003, ArXiv.