the proceedings contain 25 papers. the topics discussed include: conflict handling in product configuration using answer set programming;a normative model of explanation for binary classification legal ai and its impl...
the proceedings contain 25 papers. the topics discussed include: conflict handling in product configuration using answer set programming;a normative model of explanation for binary classification legal ai and its implementation on causal explanations of answer set programming;translating definitions into the language of logicprogramming: a case study;a semantics for probabilistic answer set programs with incomplete stochastic knowledge;constrained default logicprogramming;correct causal inference in probabilistic logicprogramming;a causal perspective on ai deception in games;epistemic logic programs: a novel perspective and some extensions;and modeling administrative discretion using goal-directed answer set programming.
the proceedings contain 39 papers. the topics discussed include: two languages, one system: tightly connecting XSB Prolog and Python;probabilistic logicprogramming: semantics, inference and learning;50th anniversary ...
the proceedings contain 39 papers. the topics discussed include: two languages, one system: tightly connecting XSB Prolog and Python;probabilistic logicprogramming: semantics, inference and learning;50th anniversary of the birth of prolog: some reflections on prolog's evolution, status, and future;tree-like justification systems are consistent;a preliminary data-driven analysis of common errors encountered by novice SPARC programmers;solving problems in PH with ASP(Q): preliminary results;on model reconciliation: how to reconcile when robot does not know human's model?;towards stream reasoning with deadlines;a fixpoint characterization of three-valued disjunctive hybrid MKNF knowledge bases;an iterative fixpoint semantics for MKNF hybrid knowledge bases with function symbols;and jumping evaluation of nested regular path queries.
this paper develops a new formalism CDLP by combining ASP and constrained default logic to facilitate modeling questions with incomplete information, such that both Reiter’s defaults and constraint defaults can be re...
详细信息
In the process of creating a declarative program, the programmer transforms a problem specification expressed in a natural language into an executable specification. We study the case when the given specification is e...
详细信息
this paper is an extended abstract of: J. Arias, M. Moreno-Rebato, J. A. Rodriguez-García, S. Ossowski, Modeling Administrative Discretion Using Goal-Directed Answer Set programming, in: Advances in Artificial In...
详细信息
For modeling the assumption-based intelligent agents who make assumptions and use them to construct their belief sets, this paper proposes a logicprogramming language AASP (Assumable Answer Set programming) by extend...
详细信息
In this paper, we present a goal-directed proof procedure for ASP with abduction. Our proposed procedure in this paper is correct for any consistent abductive framework proposed in [Kakas90a]. In other words, if the p...
详细信息
the context of the paper is developing logic-based components for hybrid – machine learning plus logic – commonsense question answering systems. the paper presents the main principles and several lessons learned fro...
详细信息
We present a model checker for Linear Temporal logic using Goal-Directed Answer Set programming under Costable model semantics (CoASP). Costable model semantics allows for positive loops to succeed unlike Stable model...
详细信息
Hybrid probabilistic logic programs extends probabilistic logic programs by adding the possibility to manage continuous random variables. Despite the maturity of the field, a semantics that unifies discrete and contin...
详细信息
暂无评论