標題: Titlebook: Logic Programming and Nonmonotonic Reasoning; 10th International C Esra Erdem,Fangzhen Lin,Torsten Schaub Conference proceedings 2009 Sprin [打印本頁] 作者: 密度 時間: 2025-3-21 19:17
書目名稱Logic Programming and Nonmonotonic Reasoning影響因子(影響力)
書目名稱Logic Programming and Nonmonotonic Reasoning影響因子(影響力)學科排名
書目名稱Logic Programming and Nonmonotonic Reasoning網絡公開度
書目名稱Logic Programming and Nonmonotonic Reasoning網絡公開度學科排名
書目名稱Logic Programming and Nonmonotonic Reasoning被引頻次
書目名稱Logic Programming and Nonmonotonic Reasoning被引頻次學科排名
書目名稱Logic Programming and Nonmonotonic Reasoning年度引用
書目名稱Logic Programming and Nonmonotonic Reasoning年度引用學科排名
書目名稱Logic Programming and Nonmonotonic Reasoning讀者反饋
書目名稱Logic Programming and Nonmonotonic Reasoning讀者反饋學科排名
作者: 高腳酒杯 時間: 2025-3-21 20:17 作者: Sleep-Paralysis 時間: 2025-3-22 02:06
SAT, SMT and Applications in lifting propositional SAT technology to richer domains, how competitions can help to improve the state-of-the-art and finally touch on applications in model checking, hardware and software verification.作者: FLACK 時間: 2025-3-22 07:23 作者: cylinder 時間: 2025-3-22 11:43
Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programsurrent ASP systems, which are based on a bottom-up computational model. However, there are also some interesting programs which are suitable for top-down query evaluation; but do not fall in the class of finitely-ground programs..In this paper, we focus on disjunctive finitely-recursive positive (DF作者: restrain 時間: 2025-3-22 16:57
Manifold Answer-Set Programs for Meta-reasoningus within the realm of ASP itself. Our technique relies on rewriting .. into a so-called ., which allows for accessing all desired consequences of .. within a single answer set. Then, this manifold program can be evaluated jointly with .. avoiding any intermediate computation step. For determining t作者: Contort 時間: 2025-3-22 18:27 作者: Cholesterol 時間: 2025-3-22 23:10 作者: endure 時間: 2025-3-23 03:37 作者: orthodox 時間: 2025-3-23 07:43
gro?artiger mittelalterlicher und frühneuzeitlicher Werke auf, w?hrend in der russischen Literatur kaum dergleichen existiert — bis auf das sp?t entdeckte und in seiner Authentizit?t immer noch umstrittene . aus dem Mittelalter sowie aus dem 18. Jahrhundert das Werk des Universalgelehrten Michail Lo作者: 原來 時間: 2025-3-23 18:45 作者: GLIB 時間: 2025-3-24 01:13 作者: HUMP 時間: 2025-3-24 04:32 作者: 埋伏 時間: 2025-3-24 10:28 作者: 頑固 時間: 2025-3-24 14:41
Jos de Bruijn,Stijn Heymansen dazu, wie die Kinder gruppendynamische Prozesse wahrgenommen und mitgestaltet haben, welche Erfahrungen sie in mitunter unterschiedlichen Gruppenkonstellationen gemacht haben und inwieweit dies Rückwirkungen auf pers?nliche Verhaltens- oder Einstellungsmuster hatte, nehmen in vielen Interviews ei作者: 黃瓜 時間: 2025-3-24 16:32 作者: crucial 時間: 2025-3-24 19:37 作者: cringe 時間: 2025-3-25 00:23 作者: bourgeois 時間: 2025-3-25 06:26 作者: Pelvic-Floor 時間: 2025-3-25 10:07
Gerhard Brewka,Thomas Eiter verschiedenen Kontexten wie z.?B. Barrierefreiheit und Chancengleichheit, aber auch Zusatzbeeintr?chtigungen eine wichtige Rolle spielen. W?hrend Geb?rdensprache eine eigenst?ndige Sprache ist, die z.?B. zeitgleich mit der Laut- oder Schriftsprache im Rahmen einer bimodal-bilingualen F?rderung erle作者: Classify 時間: 2025-3-25 14:15 作者: Germinate 時間: 2025-3-25 16:36
Francesco Calimeri,Susanna Cozza,Giovambattista Ianni,Nicola Leoneobachten k?nnen. Die Darstellung umfasst drei Altersbereiche: (1) Erstes Lebensjahr, (2) zweites und drittes Lebensjahr sowie (3) viertes und fünftes Lebensjahr. Für jedes Lebensalter erfahren Sie von wichtigen Entwicklungsthemen (Sprachverst?ndnis, Bindung, Schlaf-Wach-Rhythmus, Selbstkonzept etc.)作者: Adjourn 時間: 2025-3-25 23:53 作者: 注意到 時間: 2025-3-26 02:48 作者: Hyperplasia 時間: 2025-3-26 06:56 作者: 悲痛 時間: 2025-3-26 09:55 作者: 統(tǒng)治人類 時間: 2025-3-26 15:14
Logic-Based Modeling in Systems Biologyy studies the various components of a biological system (e.g. genes, RNAs, proteins) in isolation, systems biology aims to understand how these components interact in order to perform complex biological functions..A variety of mathematical and computational methods is currently being used to model a作者: SMART 時間: 2025-3-26 17:50
Integrating Answer Set Programming and Satisfiability Modulo Theorieson of stable models of logic programs based on Clark’s completion and simple difference constraints. The characterization leads to a method of translating a ground logic program to a linear size theory in difference logic, i.e.?propositional logic extended with difference constraints between two int作者: 保留 時間: 2025-3-26 23:26 作者: innovation 時間: 2025-3-27 01:29
Splitting a CR-Prolog Program the introduction in A-Prolog of . (cr-rules for short), and allows an elegant formalization of events or exceptions that are unlikely, unusual, or undesired. The flexibility of the language has been extensively demonstrated in the literature, with examples that include planning and diagnostic reaso作者: 條街道往前推 時間: 2025-3-27 06:06
Contextual Argumentation in Ambient Intelligenceble context information render contextual reasoning a very challenging task. Most current Ambient Intelligence systems have not successfully addressed these challenges, as they rely on simplifying assumptions, such as perfect knowledge of context, centralized context, and unbounded computational and作者: FLAGR 時間: 2025-3-27 09:28 作者: 刀鋒 時間: 2025-3-27 15:03
A Revised Concept of Safety for General Answer Set Programsing a safety condition on program rules. If we go beyond the syntax of disjunctive programs, for instance by allowing rules with nested expressions, or perhaps even arbitrary first-order formulas, new definitions of safety are required. In this paper we consider a new concept of safety for formulas 作者: Facilities 時間: 2025-3-27 21:19
Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programst Programming (ASP) systems, such as the inability of handling infinite domains. On the other hand, admitting function symbols in ASP makes inference undecidable in the general case. Lately, the research community is focusing on finding proper subclasses for which decidability of inference is guaran作者: Supplement 時間: 2025-3-27 21:58
Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programsve context-dependent input from other modules, while allowing (mutually) recursive module calls. This can be used for more succinct and natural problem representation at the price of an exponential increase of evaluation time. In this paper, we aim at an efficient top-down evaluation of MLPs, consid作者: Substance-Abuse 時間: 2025-3-28 03:25
Complexity of the Stable Model Semantics for Queries on Incomplete Databasesctive Datalog with negation under the stable model semantics. We consider both possible and certain answers and both closed- and open-world interpretation of . with and without conditions. By reduction to stable models of logic programs we find that, under closed-world interpretation, adding negatio作者: 藐視 時間: 2025-3-28 09:37
Manifold Answer-Set Programs for Meta-reasoningc program. Simple reasoning over answer sets is sometimes supported by ASP systems (usually in the form of computing brave or cautious consequences), but slightly more involved reasoning problems require external postprocessing. Generally speaking, it is often desirable to use (a subset of) brave or作者: 鐵砧 時間: 2025-3-28 14:01
A Deductive System for FO(ID) Based on Least Fixpoint Logicpaper is to extend Gentzen’s sequent calculus to obtain a deductive inference method for FO(ID). The main difficulty in building such a proof system is the representation and inference of unfounded sets. It turns out that we can represent unfounded sets by least fixpoint expressions borrowed from st作者: 大量殺死 時間: 2025-3-28 15:05
Computing Stable Models via Reductions to Difference Logicmputing stable models of a logic program using a SAT solver presumes translating the program into a set of clauses which is the input form accepted by most SAT solvers. This leads to fairly complex super-linear translations. There are, however, interesting extensions to plain clausal propositional r作者: 密切關系 時間: 2025-3-28 19:22
A Module-Based Framework for Multi-language Constraint Modelingstrengths in a flexible way. In the framework a constraint model consists of modules with clear input/output interfaces. When combining modules, apart from the interface, a module is a black box whose internals are invisible to the outside world. Inside a module a chosen constraint language (approac作者: 陳腐的人 時間: 2025-3-29 00:26
Induction on Failure: Learning Connected Horn Theoriesthers that produce multiple clauses in response to a single seed example. A common denominator of these systems is a restricted hypothesis search space, within which each clause must individually explain some example ., or some member of an abductive explanation for .. This paper proposes a new IE a作者: 呼吸 時間: 2025-3-29 06:52 作者: 品嘗你的人 時間: 2025-3-29 09:43
A First Order Forward Chaining Approach for Answer Set Computing to elaborate a first order logic program with default negation. In a preliminary step this program, with variables, is translated in an equivalent propositional one by a first tool: the grounder. Then, the propositional program is given to a second tool: the solver. This last one computes (if they 作者: 柳樹；枯黃 時間: 2025-3-29 11:55
Knowledge Qualification through Argumentation domains, and default property persistence in temporal domains. Emphasis in this work is placed on the ., central when dealing with default reasoning, and in any attempt to integrate different forms of such reasoning..Our framework can be viewed as offering a semantics to two natural problems: . tha作者: 吹牛者 時間: 2025-3-29 16:43
How Flexible Is Answer Set Programming? An Experiment in Formalizing Commonsense in ASPrepresentation and reasoning techniques, including planning and adversarial reasoning. Most importantly, the riddle is difficult enough to make it unclear, at first analysis, whether and how Answer Set Programming or other formalisms can be used to solve it.作者: 尊嚴 時間: 2025-3-29 20:08
On Reductive Semantics of Aggregates in Answer Set Programmingsitional formulas, which help us compare the semantics and understand their properties in terms of their propositional formula representations. We also present a generalization of semantics of aggregates without involving grounding, and define loop formulas for programs with aggregates guided by the reductive approach.作者: 障礙 時間: 2025-3-30 03:10
Splitting a CR-Prolog Programg Set Theorem, one of the most useful theoretical results available for A-Prolog. The availability of the Splitting Set Theorem for CR-Prolog is expected to simplify significantly the proofs of the properties of CR-Prolog programs.作者: 易于交談 時間: 2025-3-30 04:20
Complexity of the Stable Model Semantics for Queries on Incomplete Databasesitions are easier for Datalog without than with negation. Under open-world interpretation, adding negation to non-recursive Datalog already leads to undecidability, but the complexity of certain answers for negation-free queries is the same as under closed-world interpretation.作者: 檔案 時間: 2025-3-30 10:58 作者: cauda-equina 時間: 2025-3-30 14:53
Conference proceedings 2009ptember 14–18, 2009 in Potsdam, Germany. LPNMR is a forum for exchanging ideas on declarative logic programming, nonmonotonic reasoning and knowledge representation. The aim of the c- ference is to facilitate interaction between researchers interested in the design and implementation of logic-based 作者: 勉勵 時間: 2025-3-30 17:09 作者: encomiast 時間: 2025-3-30 21:42 作者: Gratuitous 時間: 2025-3-31 01:28
Logic-Based Modeling in Systems Biology structure of a regulatory biological network, which is given by positive and negative interactions (i.e., activation and inhibition) between its different components. On the other hand, temporal logics (e.g. CTL or LTL) may be used to reason about the dynamics of a biological system, represented by a state transition graph or Kripke model.作者: Infirm 時間: 2025-3-31 05:51 作者: Employee 時間: 2025-3-31 13:01
Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programsmputing input of module calls, and one for evaluating the calls themselves with subsequent computations. Based on these results, we develop a top-down evaluation procedure that expands only relevant module instantiations. Finally, we discuss syntactic conditions for its exploitation.作者: 缺乏 時間: 2025-3-31 15:29
A Deductive System for FO(ID) Based on Least Fixpoint Logicor FO(ID,SLFP), which extends the sequent calculus for SLFP with inference rules for the inductive definitions of FO(ID). We show that this proof system is sound with respect to a slightly restricted fragment of FO(ID) and complete for a more restricted fragment of FO(ID).作者: 多產子 時間: 2025-3-31 19:45
Computing Stable Models via Reductions to Difference Logic for logic programs in an effective way. To this end, we provide succinct translations from logic programs to theories of difference logic and evaluate the potential of SMT solvers in the computation of stable models using these translations and a selection of benchmarks.作者: Incommensurate 時間: 2025-4-1 01:22 作者: 上下連貫 時間: 2025-4-1 04:19 作者: Vasodilation 時間: 2025-4-1 07:33 作者: Asymptomatic 時間: 2025-4-1 13:06 作者: 中和 時間: 2025-4-1 15:31
Logic Programming and Nonmonotonic Reasoning978-3-642-04238-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Angioplasty 時間: 2025-4-1 21:16
https://doi.org/10.1007/978-3-642-04238-6AI logics; Prolog; SAT; ambient intelligence; artificial intelligence; complexity; constraint satisfaction作者: grovel 時間: 2025-4-1 23:04
10樓作者: Nebulous 時間: 2025-4-2 06:23
10樓作者: 披肩 時間: 2025-4-2 07:43
10樓
