Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Practical algorithms for MSO model-checking on tree-decomposable graphs
In this survey, we review practical algorithms for graph-theoretic problems that are
expressible in monadic second-order logic. Monadic second-order (MSO) logic allows …
expressible in monadic second-order logic. Monadic second-order (MSO) logic allows …
[HTML][HTML] aspmc: New frontiers of algebraic answer set counting
In the last decade, there has been increasing interest in extensions of answer set
programming (ASP) that cater for quantitative information such as weights or probabilities. A …
programming (ASP) that cater for quantitative information such as weights or probabilities. A …
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Several forms of reasoning in AI–like abduction, closed world reasoning, circumscription,
and disjunctive logic programming–are well known to be intractable. In fact, many of the …
and disjunctive logic programming–are well known to be intractable. In fact, many of the …
Treewidth-aware reductions of normal ASP to SAT–Is normal ASP harder than SAT after all?
Abstract Answer Set Programming (ASP) is a paradigm for modeling and solving problems
for knowledge representation and reasoning. There are plenty of results dedicated to …
for knowledge representation and reasoning. There are plenty of results dedicated to …
Towards fixed-parameter tractable algorithms for abstract argumentation
Abstract argumentation frameworks have received a lot of interest in recent years. Most
computational problems in this area are intractable but several tractable fragments have …
computational problems in this area are intractable but several tractable fragments have …
Exact ASP counting with compact encodings
Answer Set Programming (ASP) has emerged as a promising paradigm in knowledge
representation and automated reason-ing owing to its ability to model hard combinatorial …
representation and automated reason-ing owing to its ability to model hard combinatorial …
Lower bounds for QBFs of bounded treewidth
The problem of deciding the validity (QSat) of quantified Boolean formulas (QBF) is a vivid
research area in both theory and practice. In the field of parameterized algorithmics, the well …
research area in both theory and practice. In the field of parameterized algorithmics, the well …
Answer set solving with bounded treewidth revisited
Parameterized algorithms are a way to solve hard problems more efficiently, given that a
specific parameter of the input is small. In this paper, we apply this idea to the field of answer …
specific parameter of the input is small. In this paper, we apply this idea to the field of answer …
[PDF][PDF] Plausibility Reasoning via Projected Answer Set Counting-A Hybrid Approach.
Answer set programming is a form of declarative programming widely used to solve difficult
search problems. Probabilistic applications however require to go beyond simple search for …
search problems. Probabilistic applications however require to go beyond simple search for …
Counting complexity for reasoning in abstract argumentation
In this paper, we consider counting and projected model counting of extensions in abstract
argumentation for various semantics. When asking for projected counts we are interested in …
argumentation for various semantics. When asking for projected counts we are interested in …