Knowledge Representation, Reasoning and Declarative Problem Solving

Baral, Chitta

doi:10.1017/cbo9780511543357

Cited by 928 publications

(847 citation statements)

References 0 publications

Supporting

Mentioning

842

Contrasting

Unclassified

Order By: Relevance

“…Answer set programming is a modern approach to declarative programming and has its roots in logic programming, logic-based knowledge representation and reasoning, deductive databases, and constraint solving (Gelfond and Lifschitz 1988, Baral 2003, Lifschitz 2008, Gebser et al 2017. The main idea behind answer set programming is to represent a computational problem as a (non-monotonic) logic program whose resulting models (= answer sets) correspond to solutions of the problem.…”

Section: Answer Set Programming and Natural Language Processingmentioning

confidence: 99%

Specifying and Verbalising Answer Set Programs in Controlled Natural Language

Schwitter¹

2018

EasyChair Preprints

View full text Add to dashboard Cite

We show how a bi-directional grammar can be used to specify and verbalise answer set programs in controlled natural language. We start from a program specification in controlled natural language and translate this specification automatically into an executable answer set program. The resulting answer set program can be modified following certain naming conventions and the revised version of the program can then be verbalised in the same subset of natural language that was used as specification language. The bi-directional grammar is parametrised for processing and generation, deals with referring expressions, and exploits symmetries in the data structure of the grammar rules whenever these grammar rules need to be duplicated. We demonstrate that verbalisation requires sentence planning in order to aggregate similar structures with the aim to improve the readability of the generated specification. Without modifications, the generated specification is always semantically equivalent to the original one; our bi-directional grammar is the first one that allows for semantic round-tripping in the context of controlled natural language processing.

show abstract

Section: Answer Set Programming and Natural Language Processingmentioning

confidence: 99%

Specifying and Verbalising Answer Set Programs in Controlled Natural Language

Schwitter¹

2018

EasyChair Preprints

View full text Add to dashboard Cite

show abstract

“…La programmation par ensembles réponses [2] (abrégé ici par l'acronyme anglais ASP, "answer set programming") est proche de l'idéal de la programmation déclarative : le problème est le programme. La solution est un ensemble de modèles particuliers appelés ensembles réponses.…”

Section: Représentation Du Problème En Aspunclassified

Programmation par ensembles réponses pour simuler l’assolement d’un paysage

Guyet¹,

Moinard²,

Quiniou³

2015

Revue d'intelligence artificielle

View full text Add to dashboard Cite

RésuméLe développement d'outils pour la simulation de paysages virtuels est un enjeu important pour l'étude des relations croisées entre les paysages, les processus biophysiques et leurs acteurs. Pour simuler de manière réaliste les colocalisations de cultures, nous formalisons le processus de simulation comme un problème générique de décomposi-tion d'un graphe par des sous-graphes ("structures"). Ce problème est hautement combinatoire et nous proposons d'utiliser la programmation par ensembles réponses (ASP) pour le résoudre. L'article compare plusieurs variantes du programme ASP. Mots ClefGraphe, ASP, programmation logique, simulation, paysage AbstractThe development of tools for the simulation of virtual landscapes is an important issue for the study of the relationships between landscape, biophysical processes and their actors. We are interested in simulating realistic colocalizations of cultures. We formalize the simulation process as a generic problem of decomposition of a graph by subgraphs ("structures"). This problem is highly combinatorial and we propose to solve it using answer set programming (ASP). The article compares several versions of the ASP program.

show abstract

“…In this section we discuss the use of answer set programming (ASP) [4] to model and reason about institutions, the agents that participate in them and the norms that govern them. ASP is a logic programming language that has the advantage that specification and implementation are identical, the language is easy to understand yet very powerful and expressive, it comes with efficient algorithms, called solvers, to provide the solution to the encoded problem and the availability of different types of negation: classical negation and negation-as-failure 1 , the latter giving rise to non-deterministic outcomes.…”

Section: Modelling Institutions Using Answer Set Programmingmentioning

confidence: 99%

“…In answer set programming ( [4,24]) a logic program is used to describe the requirements that must be fulfilled by the solutions of a certain problem. The answer sets of the program, usually defined through (a variant/extension of) the stable model semantics [24], then correspond to the solutions of the problem.…”

Section: Answer Set Programmingmentioning

confidence: 99%

Answer Set Programming for Representing and Reasoning About Virtual Institutions

Cliffe

Vos

Padget

2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. It is recognised that institutions are potentially powerful means for making agent interactions effective and efficient, but institutions will only really be useful when, as in other safety-critical scenarios, it is possible to prove that particular properties do or do not hold for all possible encounters. In contrast to symbolic model-checking, answer set programming permits the statement of problems and queries in domain-specific terms as executable logic programs, thus eliminating the gap between specification and verification language. Furthermore, results are presented in the same terms. In this paper we describe the use of answer set programs as an institutional modelling technique. We demonstrate that our institutional model can be intuitively be mapped into an answer set program such that the ordered event traces of the former can be obtained as the answer sets of the latter, allowing for an easy way to query properties of models.

show abstract

Knowledge Representation, Reasoning and Declarative Problem Solving

Abstract: This book describes theoretical results about AnsProlog * that have been obtained over the past decade. AnsProlog * or Prolog with Answer Sets 1 is a variation of the Prolog programming language, and extends the language by allowing clauses of the form:

Cited by 928 publications

References 0 publications

Specifying and Verbalising Answer Set Programs in Controlled Natural Language

Specifying and Verbalising Answer Set Programs in Controlled Natural Language

Programmation par ensembles réponses pour simuler l’assolement d’un paysage

Answer Set Programming for Representing and Reasoning About Virtual Institutions

Contact Info

Product

Resources

About