Anticoagulants
发表于 2025-3-28 16:19:05
http://reply.papertrans.cn/59/5882/588182/588182_41.png
faucet
发表于 2025-3-28 19:18:23
http://reply.papertrans.cn/59/5882/588182/588182_42.png
小卒
发表于 2025-3-29 00:42:20
The Complexity of One-Agent Refinement Modal Logicg refinement quantifiers on structures. It is known that . has the same expressiveness as ., but the translation of . into . is of non-elementary complexity, and . is at least . exponentially more succinct than .. In this paper, we show that .-satisfiability is ‘only’ . exponentially harder than .-s
Fatten
发表于 2025-3-29 04:18:02
The View-Update Problem for Indefinite Databasespresented, following the standard database approach, by a single . constant. The paper formalizes views over such databases as indefinite . databases, and defines for them several classes of database repairs that realize view-update requests. Most notable is the class of .. Constrained repairs chang
粗糙滥制
发表于 2025-3-29 09:45:30
http://reply.papertrans.cn/59/5882/588182/588182_45.png
CANT
发表于 2025-3-29 13:09:03
http://reply.papertrans.cn/59/5882/588182/588182_46.png
chalice
发表于 2025-3-29 19:06:05
Using Satisfiability for Non-optimal Temporal Planning effective in finding optimal plans for both classical and temporal planning. It is also known that by using planning-based heuristic information in solving SAT formulae, one can develop SAT-based planners that are competitive with state-of-the-art non-optimal planners in classical planning domains.
PALSY
发表于 2025-3-29 19:46:50
How to Exploit Parametric Uniformity for Maximum Entropy Reasoning in a Relational Probabilistic Lognowledge base . can be exploited for solving the optimization problem required for ME reasoning more efficiently. The original ME optimization problem containing a large number of linear constraints, one for each ground instance of a conditional, can be replaced by an optimization problem containing
trigger
发表于 2025-3-30 03:12:03
http://reply.papertrans.cn/59/5882/588182/588182_49.png
paroxysm
发表于 2025-3-30 05:52:43
A Selective Semantics for Logic Programs with Preferences preferences and several semantics have been proposed. Among the available semantics, the so-called . semantics have the property of always choosing preferred answer sets from among the standard answer sets, which is a desirable property in many applications. However, there exist programs which whil