We automate deep step-by step reasoning in an LLM dialog thread by recursively exploring alternatives (OR-nodes) and expanding details (AND-nodes) up to a given depth. Starting from a single succinct task-specific ini...
详细信息
We are proposing a keyword-based query interface for knowledge bases - including relational or deductive databases - based on contextual background knowledge such as suitable join conditions or synonyms. Join conditio...
详细信息
We present an enhancement of exp(ASP), a system that generates explanation graphs for a literal-an atom a or its default negation ∼ a-given an answer set A of a normal logic program P, which explain why ` is true (or...
详细信息
Intensional logic programming is an extension of logic programming based on intensional logic, which includes as special cases both temporal and modal logic programming. In [OW92], M. Orgun and W. W. Wadge provided a ...
详细信息
ISBN:
(纸本)9783642405648
Intensional logic programming is an extension of logic programming based on intensional logic, which includes as special cases both temporal and modal logic programming. In [OW92], M. Orgun and W. W. Wadge provided a general framework for capturing the semantics of intensional logic programming languages. One key property involved in the construction of [OW92], is the monotonicity of intensional operators. In this paper we consider intensional logic programming from a game-theoretic perspective. In particular we define a two-person game and we demonstrate that it is equivalent to the semantics of [OW92]. More importantly, we demonstrate that the game is even applicable to intensional languages with non-monotonic operators. In this way we provide the first (to our knowledge) general semantic framework for capturing the semantics of non-monotonic intensional logic programming.
s(CASP) is related to ASP. Unlike ASP, which is traditionally solved using grounding and a SAT solver, s(CASP) is solved using top-down goal directed search without grounding. This allows s(CASP) to solve problems tha...
详细信息
Reaction Systems (RSs) are a successful computational framework inspired by biological systems. A RS combines a set of entities with a set of reactions over them. Entities can be provided by an external context, used ...
详细信息
Citation recommendation focuses on recommending references to the given document automatically. While the existing works have achieved improvements in citation recommendation, their quality may still be degraded due t...
详细信息
Citation recommendation focuses on recommending references to the given document automatically. While the existing works have achieved improvements in citation recommendation, their quality may still be degraded due to the cold-start problem or insufficient use of features. To alleviate these problems, we investigate the possibility of fully utilizing a document's features from different dimensions. Specifically, we present a citation recommendation model based on Siamese BERT and Knowledge Graph (CRM-SBKG), a mixture model that mines the text feature and entity feature to obtain the recommendation list. We use the BERT model with the Siamese network for text feature extraction and build a citation knowledge graph where entity feature is extracted. We apply the proposed model on Open Academic Graph (OAG) and DataBase systems and logic programming (DBLP). The results show that our model outperforms the baselines significantly. It reflects that the proposed model can extract features more effectively and make better citation recommendations.
We recently proposed Acceleration Driven Clause Learning (ADCL), a novel calculus to analyze satisfiability of Constrained Horn Clauses (CHCs). Here, we adapt ADCL to disprove termination of transition systems, and we...
详细信息
Solving Constrained Horn Clauses (CHCs) is a fundamental challenge behind a wide range of verification and analysis tasks. To enhance CHC solving without the laborious task of manual heuristic creation and tuning, dat...
详细信息
Answer set programming (ASP) is a declarative logic programming paradigm geared towards solving difficult combinatorial search problems. While different logic programs can encode the same problem, their performance ma...
详细信息
暂无评论