Knowledge Representation, Reasoning and Declarative Problem Solving
By Chitta Baral. 2003
1,507 citations recorded by the source corpus.
Subfields: History, Literature and Literary Theory, Sociology and Political Science, Natural Language Processing
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In History
- Torsten Schaub
- Martin Gebser
- Benjamin Kaufmann
- Anette Frank
- Michael Anderson
- Susan Leigh Anderson
- Arindam Mitra
- Juri Opitz
In Literature and Literary Theory
- Torsten Schaub
- Martin Gebser
- Benjamin Kaufmann
- Anette Frank
- Michael Anderson
- Susan Leigh Anderson
- Arindam Mitra
- Juri Opitz
In Sociology and Political Science
- Torsten Schaub
- Martin Gebser
- Benjamin Kaufmann
- Anette Frank
- Michael Anderson
- Susan Leigh Anderson
- Arindam Mitra
- Juri Opitz
In Natural Language Processing
- Anette Frank
- Torsten Schaub
- Martin Gebser
- Benjamin Kaufmann
- Arindam Mitra
- Juri Opitz
- Michael Anderson
- Susan Leigh Anderson
Citations in the corpus
- RuleBERT: Teaching Soft Rules to Pre-Trained Language Models (2021, background): “LP is a probabilistic extension of answer set programs (ASP) with the concept of weighted rules from Markov Logic (Baral, 2010).”
- Addressing the Winograd Schema Challenge as a Sequence Ranking Task (2018, methodology): “Both works use the Answer Set Programming language (ASP, cf. (Baral, 2003; Gelfond and Lifschitz, 1988)) on the generated abstract representations for reasoning about the correct antecedent.”
- clasp : A Conflict-Driven Answer Set Solver (2007, methodology): “Our new system clasp [1] combines the high-level modeling capacities of Answer Set Programming (ASP; [2]) with state-of-the-art techniques from the area of Boolean constraint solving.”
- Answer Set Solving in Practice (2012, background): “Annals of Mathematics and Artificial Intelligence, 25(3-4):241–273, 1999.”
- Multi-shot ASP solving with clingo (2017, background): “Standard Answer Set Programming (ASP; (Baral 2003)) follows a one-shot process in computing stable models of logic programs.”
- Learning to Automatically Solve Logic Grid Puzzles (2015, methodology): “There has been a significant amount of work on the representation of puzzle problems in a formal language (Gelfond and Kahl, 2014; Baral, 2003; Celik et al., 2009).”
- Machine Ethics: Creating an Ethical Intelligent Agent (2007, positive): “It has been noted (Ganascia 2007) that answer set programming (ASP) (Baral 2003) may serve as an efficient formalism for modeling such ethical reasoning.”
- Combining answer set programming with description logics for the Semantic Web (2004, positive): “(1997), Baral (2003) (cf. also (Alsaç & Baral 2001)), Swift (2004), Grosof et al. (2003), and Heymans and Vermeir (2003a; 2003b). In detail, Van Belleghem et al. (1997) presents a mapping of description logic knowledge bases in ALCN to open logic programs, and shows how other description logics corr”
- A Physician Advisory System for Chronic Heart Failure management based on knowledge patterns (2016, background): “KEYWORDS: chronic disease management, knowledge pattern, answer set programming, knowledge representation, automated reasoning”
- Conflict-Driven Answer Set Solving (2007, methodology): “For a formal introduction to ASP, we refer the reader to [Baral, 2003].”
- Conflict-driven answer set solving: From theory to practice (2012, background): “For further details and broader overviews about the area of ASP, we refer the interested reader to [6, 65].”
- Automated Algorithm Selection: Survey and Perspectives (2018, background): “nsive to compute and may thus be of limited usefulness in the context of per-instance algorithm selection. A well-known generalisation of SAT is the problem of answer set programming (ASP; see, e.g., Baral, 2003), which deals with determining so-called “answer sets”, i.e., stable models for logic pr”
- Potassco: The Potsdam Answer Set Solving Collection (2011, neutral): “Answer Set Programming (ASP; [5]) has become a popular approach to declarative problem solving in the field of Knowledge Representation and Reasoning (KRR; [79]).”