Towards a Theory of Declarative Knowledge

By Krzysztof R. Apt, H. A. Blair, A. Walker. 1988

Subfields: Knowledge Graphs & Representation

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Knowledge Graphs & Representation

Citations in the corpus

Transformers as Soft Reasoners over Language (2020, methodology): “For semantics, we treat the rule-base as a logic program, and infer the minimal, supported answer set implied by the program [Apt et al. , 1988].”
Inductive Logic Programming (2014, methodology): “the title of ensemble methods and include boosting [9,13] and bagging [6,25].”
Potassco: The Potsdam Answer Set Solving Collection (2011, unknown): “7The models of the Clark completion [12] of a program are called supported models [2].”
A general datalog-based framework for tractable query answering over ontologies (2009, background): “We also allow a limited form of equation generating dependencies, namely, keys, to be speci.ed, but we require that these keys be in a precise sense not con.icting with the existential rules of the Datalog program.”
The well-founded semantics for general logic programs (1991, background): “The strati ed class has been treated in [5, 1, 19, 40], and elsewhere.”
Complexity and expressive power of logic programming (1997, background): “3 (implicit in [Apt et al. 1988]) Stratified propositional log ic programming with negation is P-complete.”
Conflict-driven answer set solving: From theory to practice (2012, methodology): “The models of the Clark completion of a program are called supported models [3]; on tight programs, they coincide with answer sets [40].”
Flexible support for multiple access control policies (2001, methodology): “The predicate dercando represents authorizations derived by the system using logical rules of inference (modus ponens plus rules for strati.ed negation [Apt et al. 1988]).”
General Logical Databases and Programs: Default Logic Semantics and Stratification (1991, methodology): “In the following, the term “logical database” designates a positivist default theory or its associated set of P-clauses depending on the framework.”
Conflict-Driven Answer Set Solving (2007, methodology): “The nogoods in Δ Π capture the supported models of a program [Apt et al. , 1987].”
ASSAT: computing answer sets of a logic program by SAT solvers (2002, background): “To address this problem, we define a loop in a program to be a set of atoms such that for any pair of atoms in the set, there is a positive path from one to the other in the dependency graph of the program [1].”