the operation of a typical answer set solver begins with grounding-replacing the given program with a program without variables that has the same answer sets. When the given program contains function symbols, the proc...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
the operation of a typical answer set solver begins with grounding-replacing the given program with a program without variables that has the same answer sets. When the given program contains function symbols, the process of grounding may not terminate. In this note we give an example of a pair of consistent, strongly equivalent programs such that one of them can be grounded by LPARSE, DLV, and GRINGO, and the other cannot.
In recent years logicprogramming based languages and features such as rules and non-monotonic constructs have become important in various knowledge representation paradigms. While the early logicprogramming language...
详细信息
ISBN:
(纸本)9783642239625;9783642239632
In recent years logicprogramming based languages and features such as rules and non-monotonic constructs have become important in various knowledge representation paradigms. While the early logicprogramming languages, such as Horn logic programs and Prolog did not focus on expressing and reasoning with uncertainty, in recent years logicprogramming languages have been developed that can express bothlogical and quantitative uncertainty. In this paper we give an overview of such languages and the kind of uncertainty they can express and reason with. Among those, we slightly elaborate on the language P-log that not only accommodates probabilistic reasoning, but also respects causality and distinguishes observational and action updates.
Answer Set programming, or ASP, is now becoming well-established as a declarative approach to problem-solving in AI and in an increasing number of practical, application domains. While a significant part of ASP resear...
详细信息
ISBN:
(纸本)9783642208942
Answer Set programming, or ASP, is now becoming well-established as a declarative approach to problem-solving in AI and in an increasing number of practical, application domains. While a significant part of ASP research is devoted to producing and applying faster and more user-friendly solvers, there is also a growing interest in studying extensions of the basic language of ASP. Additions to the language that are currently being developed include function symbols, temporal and causal operators, as well as devices to deal with aggregates, preferences, ontologies, resources, and many others.
Domains, such as Ambient intelligence and Social Networks, are characterized by some common features including distribution of the available knowledge, entities with different backgrounds, viewpoints and operational e...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
Domains, such as Ambient intelligence and Social Networks, are characterized by some common features including distribution of the available knowledge, entities with different backgrounds, viewpoints and operational environments, and imperfect knowledge. Multi-Context Systems (MCS) has been proposed as a natural representation model for such environments, while recent studies have proposed adding non-monotonic features to MCS to address the issues of incomplete, uncertain and ambiguous information. In previous works, we introduced a non-monotonic extension to MCS and an argument-based reasoning model that handle imperfect context information based on defeasible argumentation. Here we propose alternative variants that integrate features such as partial preferences, ambiguity propagating and team defeat, and study the relations between the different variants in terms of conclusions being drawn in each case.
this article presents cmMUS-a tool for deciding whether a clause belongs to some minimal unsatisfiable subset (MUS) of a given formula. While MUS-membership has a number of practical applications, related with underst...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
this article presents cmMUS-a tool for deciding whether a clause belongs to some minimal unsatisfiable subset (MUS) of a given formula. While MUS-membership has a number of practical applications, related with understanding the causes of unsatisfiability, it is computationally challenging-it is Sigma(P)(2)-complete. the presented tool cmMUS solves the problem by translating it to propositional circumscription, a well-known problem from the area of nonmonotonic reasoning. the tool constantly outperforms other approaches to the problem, which is demonstrated on a variety of benchmarks.
We report on three recent advances in the distributed ASP solver claspar. First, we describe its flexible architecture supporting various search strategies, including competitive search using a portfolio of solver con...
详细信息
ISBN:
(纸本)9783642208942
We report on three recent advances in the distributed ASP solver claspar. First, we describe its flexible architecture supporting various search strategies, including competitive search using a portfolio of solver configurations. Second, we describe claspar's distributed learning capacities that allow for sharing learned nogoods among solver instances. Finally, we discuss claspar's approach to distributed optimization.
Answer Set programming (ASP) is a truly-declarative programming paradigm proposed in the area of non-monotonic reasoning and logicprogramming. In the last few years, several tools for ASP-program development have bee...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
Answer Set programming (ASP) is a truly-declarative programming paradigm proposed in the area of non-monotonic reasoning and logicprogramming. In the last few years, several tools for ASP-program development have been proposed, including (more or less advanced) editors and debuggers. However, ASP still lacks an Integrated Development Environment (IDE) supporting the entire life-cycle of ASP development, from (assisted) programs editing to application deployment. In this paper we present ASPIDE, a comprehensive IDE for ASP, integrating a cutting-edge editing tool (featuring dynamic syntax highlighting, on-line syntax correction, autocompletion, code-templates, quick-fixes, refactoring, etc.) with a collection of user-friendly graphical tools for program composition, debugging, profiling, database access, solver execution configuration and output-handling.
We consider a housekeeping domain with multiple cleaning robots and represent it in the action language C+. With such a formalization of the domain, a plan can be computed using the causal reasoner CCALC for each robo...
详细信息
ISBN:
(纸本)9783642208942
We consider a housekeeping domain with multiple cleaning robots and represent it in the action language C+. With such a formalization of the domain, a plan can be computed using the causal reasoner CCALC for each robot to tidy some part of the house. However, to find a plan that characterizes a feasible trajectory that does not collide with obstacles, we need to consider geometric reasoning as well. For that, we embed motion planning in the domain description using external predicates. For safe execution of feasible plans, we introduce a planning and monitoring algorithm so that the robots can recover from plan execution failures due to heavy objects that cannot be lifted alone. the coordination of robots to help each other is considered for such a recovery. We illustrate the applicability of this algorithm with a simulation of a housekeeping domain.
We introduce a formal argumentation method based on normal programs and rewriting systems which is able to define extensions of the grounded semantics based on specific rewriting rules which perform particular kind of...
详细信息
ISBN:
(纸本)9781607508427;9781607508410
We introduce a formal argumentation method based on normal programs and rewriting systems which is able to define extensions of the grounded semantics based on specific rewriting rules which perform particular kind of reasoning as in reasoning by cases. these new argumentation semantics are intermediate argumentation semantics between the grounded and the preferred semantics.
We propose External Transaction logic (or ET R), an extension of Transaction logic able to represent updates in internal and external domains whilst ensuring a relaxed transaction model. Withthis aim, ETR deals with ...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
We propose External Transaction logic (or ET R), an extension of Transaction logic able to represent updates in internal and external domains whilst ensuring a relaxed transaction model. Withthis aim, ETR deals with two main components: an internal knowledge base where updates follow the strict ACID model, given by the semantics of Transaction logic;and an external knowledge base of which one has limited or no control and can only execute external actions. When executing actions in the external domain, if a failure occurs, it is no longer possible to simply rollback to the initial state before executing the transaction. For dealing withthis, similarly to what is done in databases, we define compensating operations for each external action to be performed to ensure a relaxed model of atomicity and consistency. By executing these compensations in backward order, we obtain a state considered to be equivalent to the initial one.
暂无评论