Answer-Set programming (ASP) is an established declarative programming paradigm. However, classical ASP lacks subprogram calls as in procedural programming, and access to external computations (akin to remote procedur...
详细信息
this paper presents a bounded model checking approach for propositional projection temporal logic (PPTL). To this end, first PPTL is briefly introduced. then, bounded semantics of PPTL is defined according to its sema...
详细信息
In order to give appropriate semantics to qualitative conditionals of the form if A then normally B, ordinal conditional functions (OCFs) ranking the possible worlds according to their degree of plausibility can be us...
详细信息
Backtracking is a basic technique of search-based satisfiability (SAT) solvers. In order to backtrack, a SAT solver uses conflict analysis to compute a backtracking level and discards all the variable assignments made...
详细信息
We report about the current state and designated features of the tool SeaLion, aimed to serve as an integrated development environment (IDE) for answer-set programming (ASP). A main goal of SeaLion is to provide a use...
详细信息
First-order modal logics (FMLs) can be modeled as natural fragments of classical higher-order logic (HOL). the FMLtoHOL tool exploits this fact and it enables the application of off-the-shelf HOL provers and model fin...
详细信息
Automated theorem finding is one of 33 basic research problems in automated reasoning which was originally proposed by Wos in 1988, and it is still an open problem. For the problem, Cheng has proposed a forward deduct...
详细信息
the proceedings contain 24 papers. the topics discussed include: knowledge-directed theory revision;towards clausal discovery for stream mining;on the relationship between logical Bayesian networks and probabilistic l...
ISBN:
(纸本)364213839X
the proceedings contain 24 papers. the topics discussed include: knowledge-directed theory revision;towards clausal discovery for stream mining;on the relationship between logical Bayesian networks and probabilistic logicprogramming based on the distribution semantics;induction of relational algebra expressions;a logic-based approach to relation extraction from texts;discovering rules by meta-level abduction;inductive generalization of analytically learned goal hierarchies;nonmonotonic onto-relational learning;cp-logictheory inference with contextual variable elimination and comparison to BDD based inference methods;speeding up inference in statistical relational learning by clustering similar query literals;an inductivelogicprogramming approach to validate hexose binding biochemical knowledge;boosting first-order clauses for large, skewed data sets;and transfer learning via relational templates.
We foster a novel implementation technique for logic program updates, which exploits incremental tabling in logicprogramming - using XSB Prolog to that effect. Propagation of updates of fluents is controlled by initi...
详细信息
Dung’s famous abstract argumentation frameworks represent the core formalism for many problems and applications in the field of argumentation which significantly evolved within the last decade. Recent work in the fie...
详细信息
暂无评论