Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[KSIĄŻKA][B] Answer set programming: A primer
Abstract Answer Set Programming (ASP) is a declarative problem solving paradigm, rooted
in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing …
in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing …
Equilibrium logic
D Pearce - Annals of Mathematics and Artificial Intelligence, 2006 - Springer
Equilibrium logic is a general purpose nonmonotonic reasoning formalism closely aligned
with answer set programming (ASP). In particular it provides a logical foundation for ASP as …
with answer set programming (ASP). In particular it provides a logical foundation for ASP as …
Engineering an incremental ASP solver
Many real-world applications, like planning or model checking, comprise a parameter
reflecting the size of a solution. In a propositional formalism like Answer Set Programming …
reflecting the size of a solution. In a propositional formalism like Answer Set Programming …
On dynamics in structured argumentation formalisms
This paper is a contribution to the research on dynamics in assumption-based
argumentation (ABA). We investigate situations where a given knowledge base undergoes …
argumentation (ABA). We investigate situations where a given knowledge base undergoes …
Some (in) translatability results for normal logic programs and propositional theories
T Janhunen - Journal of Applied Non-Classical Logics, 2006 - Taylor & Francis
In this article, we compare the expressive powers of classes of normal logic programs that
are obtained by constraining the number of positive subgoals (n) in the bodies of rules. The …
are obtained by constraining the number of positive subgoals (n) in the bodies of rules. The …
Uniform equivalence of logic programs under the stable model semantics
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of
logic programs P and Q has been considered, which holds if the programs P∪ R and Q∪ R …
logic programs P and Q has been considered, which holds if the programs P∪ R and Q∪ R …
Modularity aspects of disjunctive stable models
Practically all programming languages allow the programmer to split a program into several
modules which brings along several advantages in software development. In this paper, we …
modules which brings along several advantages in software development. In this paper, we …
[PDF][PDF] On solution correspondences in answer-set programming
We introduce a general framework for specifying program correspondence under the
answer-set semantics. The framework allows to define different kinds of equivalence …
answer-set semantics. The framework allows to define different kinds of equivalence …
[PDF][PDF] Modular equivalence for normal logic programs
A Gaifman-Shapiro-style architecture of program modules is introduced in the case of
normal logic programs under stable model semantics. The composition of program modules …
normal logic programs under stable model semantics. The composition of program modules …
Semantical characterizations and complexity of equivalences in answer set programming
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of
logic programs P and Q has been considered, which holds if the programs P∪ R and Q∪ R …
logic programs P and Q has been considered, which holds if the programs P∪ R and Q∪ R …