Answer Set programming (ASP) is a logic programming paradigm featuring a purely declarative language with comparatively high modeling capabilities. Indeed, ASP can model problems in NP in a compact and elegant way. Ho...
详细信息
logic Programs with Ordered Disjunction (LPOD) is an extension of standard answer set programs to handle preference using the construct of ordered disjunction, and CR-Prolog(2) is an extension of standard answer set p...
详细信息
logic Programs with Ordered Disjunction (LPOD) is an extension of standard answer set programs to handle preference using the construct of ordered disjunction, and CR-Prolog(2) is an extension of standard answer set programs with consistency restoring rules and LPOD-like ordered disjunction. We present reductions of each of these languages into the standard ASP language, which gives us an alternative way to understand the extensions in terms of the standard ASP language.
Our research concerns generating imperative programs from Answer Set programming Specifications. ASP is highly declarative and is ideal for writing specifications. Further with negation-as-failure it is easy to succin...
详细信息
Answer set programming is a prominent declarative programming paradigm used in formulating combinatorial search problems and implementing different knowledge representation formalisms. Frequently, several related and ...
详细信息
In recent years, different methods for supporting the development of answer-set programming (ASP) code have been introduced. During such a development process, often it would be desirable to have a natural-language re...
详细信息
ISBN:
(纸本)9783030008017;9783030008000
In recent years, different methods for supporting the development of answer-set programming (ASP) code have been introduced. During such a development process, often it would be desirable to have a natural-language representation of answer sets, e.g., when dealing with domain experts unfamiliar with ASP. In this paper, we address this point and provide an approach for such a representation, defined in terms of a controlled natural language (CNL), which in turn relies on the annotation language Lana for the specification of meta-information for answer-set programs. Our approach has been implemented as an Eclipse plug-in for SeaLion, a dedicated IDE for ASP.
We consider tools for developing information systems with use of Model Driven Architecture (MDA) and Linked Open Data technologies (LOD). The original idea of LOD is to allow the software designers to develop program ...
详细信息
ISBN:
(数字)9783319999722
ISBN:
(纸本)9783319999722;9783319999715
We consider tools for developing information systems with use of Model Driven Architecture (MDA) and Linked Open Data technologies (LOD). The original idea of LOD is to allow the software designers to develop program systems integrated by means of common ontologies and web protocols. MDA Platform Independent Model (PIM) is expressed as set of UML diagrams. PIM forms a LOD graph and its namespace. All the PIM entities are defined as ontology resources, i.e. with URI references to LOD terms. This allows us to translate PIM UML model to a set of triples and store them in an ontology ware-house for further transformation into a Platform Specific Model (PSM). The ClioPatria ontology server and the SWI Prolog language are used as tools of PIM and PSM storage, querying and processing. The tools will allow us to mediate the MDA static means of code generation and configuration at development stage with the techniques of flexible data structure processing at run time, thus, producing even more productive information system development and maintenance techniques. This research corresponds to nowadays direction of Semantic Web Software Engineering.
The Winograd Schema Challenge (WSC) is a natural language understanding task proposed as an alternative to the Turing test in 2011. In this work we attempt to solve WSC problems by reasoning with additional knowledge....
详细信息
Information Retrieval (IR) aims at retrieving documents that are most relevant to a query provided by a user. Traditional techniques rely mostly on syntactic methods. In some cases, however, links at a deeper semantic...
详细信息
Answer Set programming (ASP) solvers are highly-tuned and complex procedures that implicitly solve the consistency problem, i.e., deciding whether a logic program admits an answer set. Verifying whether a claimed answ...
详细信息
Answer Set programming (ASP) is a well-established formalism for nonmonotonic reasoning. Paracoherent semantics for ASP have been suggested as a remedy, to handle cases in which no answer set exists due to the usage o...
详细信息
暂无评论