Search Results for author:
Found 14 papers, 2 papers with code
Explanations for Answer Set Programming
Different from xASP, the new system, xASP2, supports different clingo constructs like the choice rules, the constraints, and the aggregates such as #sum, #min.
Answer Set Planning: A Survey
Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans, i. e., solutions to planning problems, that transform a given state of the world to another state.
Specifying and Reasoning about CPS through the Lens of the NIST CPS Framework
This paper introduces a formal definition of a Cyber-Physical System (CPS) in the spirit of the CPS Framework proposed by the National Institute of Standards and Technology (NIST).
exp(ASPc) : Explaining ASP Programs with Choice Atoms and Constraint Rules
We present an enhancement of exp(ASP), a system that generates explanation graphs for a literal l - an atom a or its default negation ~a - given an answer set A of a normal logic program P, which explain why l is true (or false) given A and P. The new system, exp(ASPc), differs from exp(ASP) in that it supports choice rules and utilizes constraint rules to provide explanation graphs that include information about choices and constraints.
Generating explanations for answer set programming applications
We present an explanation system for applications that leverage Answer Set Programming (ASP).
Action-Centered Information Retrieval
Information Retrieval (IR) aims at retrieving documents that are most relevant to a query provided by a user.
An ASP Methodology for Understanding Narratives about Stereotypical Activities
We exemplify the application of this methodology by answering questions about a number of restaurant stories.
Ontology-Based Reasoning about the Trustworthiness of Cyber-Physical Systems
The example analyzed in the paper demonstrates the enrichment of the original CPS model obtained through ontology and reasoning and its ability to deliver additional insights to the developers and operators of CPS.
CASP Solutions for Planning in Hybrid Domains
CASP is an extension of ASP that allows for numerical constraints to be added in the rules.
Constraint Answer Set Solver EZCSP and Why Integration Schemas Matter
One of the main contributions of this paper is the first comprehensive account of the constraint answer set language and solver EZCSP, a mainstream representative of this research area that has been used in various successful applications.
PDDL+ Planning via Constraint Answer Set Programming
PDDL+ is an extension of PDDL that enables modelling planning domains with mixed discrete-continuous dynamics.
Towards an ASP-Based Architecture for Autonomous UAVs in Dynamic Environments (Extended Abstract)
Although ASP has been used successfully in a number of applications, to the best of our knowledge this is the first practical application of a complete ASP-based agent architecture.
An ASP-Based Architecture for Autonomous UAVs in Dynamic Environments: Progress Report
Although ASP has been used successfully in a number of applications, and ASP-based architectures have been studied for about a decade, to the best of our knowledge this is the first practical application of a complete ASP-based agent architecture.
Hybrid Automated Reasoning Tools: from Black-box to Clear-box Integration
Recently, researchers in answer set programming and constraint programming spent significant efforts in the development of hybrid languages and solving algorithms combining the strengths of these traditionally separate fields.
