Add to ORKGAnswer Set Programming is a compelling non-monotonic knowledge representation paradigm for representing specifications in controlled natural language and reasoning about them. In this paper, we introduce the controlled natural language PENGASP and discuss the kind of answer set programs that the PENGASP system automatically generates for a given specification. The controlled natural language PENGASP is unique, since it is the first controlled natural language that uses Answer Set Programming as target language for reasoning, in particular for question answering. PENGASP allows us to specify factual and terminological knowledge, to combine weak and strong negation in order to specify a local form of the closed world assumption, to deal with ...
Answer Set Programming (ASP; [1], [2], [3], [4]) is a declarative problem solving approach, combinin...
The search for an appropriate characterization of negation as failure in logic programs in the mid 1...
In this paper, we discuss how statements about defaults and various forms of exceptions to them can ...
Controlled natural languages are subsets of natural languages that can be used to describe a problem...
Most controlled natural languages (CNLs) are processed with the help of a pipeline architecture that...
Abstract. Answer Set Programming (ASP; [1,2,3,4]) is a declarative problem solving approach, combini...
Answer set programming (ASP) has emerged as an approach to declarative problem solving based on the ...
Answer set programming (ASP) is a declarative programming paradigm based on an interpretation of log...
One way to solve the knowledge acquisition bottle-neck is to have ways to translate natural language...
1.1 The Answer-Set Programming Paradigm In recent years, the Answer Set Programming (ASP) paradigm h...
Answer set programming (ASP) is a method for solving hard problems using computational logic. We des...
Answer set programming is a declarative programming paradigm based on the answer set semantics of lo...
The term answer set programming (ASP) was coined by Vladimir Lifschitz to refer to a new declarative...
Dottorato di Ricerca in Matematica ed Informatica. Ciclo XXXIThis work is focused on Answer Set Prog...
While in recent years machine learning (ML) based approaches have been the popular approach in devel...
Answer Set Programming (ASP; [1], [2], [3], [4]) is a declarative problem solving approach, combinin...
The search for an appropriate characterization of negation as failure in logic programs in the mid 1...
In this paper, we discuss how statements about defaults and various forms of exceptions to them can ...
Controlled natural languages are subsets of natural languages that can be used to describe a problem...
Most controlled natural languages (CNLs) are processed with the help of a pipeline architecture that...
Abstract. Answer Set Programming (ASP; [1,2,3,4]) is a declarative problem solving approach, combini...
Answer set programming (ASP) has emerged as an approach to declarative problem solving based on the ...
Answer set programming (ASP) is a declarative programming paradigm based on an interpretation of log...
One way to solve the knowledge acquisition bottle-neck is to have ways to translate natural language...
1.1 The Answer-Set Programming Paradigm In recent years, the Answer Set Programming (ASP) paradigm h...
Answer set programming (ASP) is a method for solving hard problems using computational logic. We des...
Answer set programming is a declarative programming paradigm based on the answer set semantics of lo...
The term answer set programming (ASP) was coined by Vladimir Lifschitz to refer to a new declarative...
Dottorato di Ricerca in Matematica ed Informatica. Ciclo XXXIThis work is focused on Answer Set Prog...
While in recent years machine learning (ML) based approaches have been the popular approach in devel...
Answer Set Programming (ASP; [1], [2], [3], [4]) is a declarative problem solving approach, combinin...
The search for an appropriate characterization of negation as failure in logic programs in the mid 1...
In this paper, we discuss how statements about defaults and various forms of exceptions to them can ...