At the occasion of the third internationalconference on Principles of Knowledge Representation and reasoning [1] in 1992, Ray Reiter delivered an invited talk entitled "Twelve Years of nonmonotonicreasoning Res...
详细信息
Four-valued semantics is applied to a deduction basis for granular reasoning with zooming operation. this enables the granular reasoning useful for the foundation of reasoning for incomplete and inconsistent informati...
详细信息
ISBN:
(纸本)9781538626337
Four-valued semantics is applied to a deduction basis for granular reasoning with zooming operation. this enables the granular reasoning useful for the foundation of reasoning for incomplete and inconsistent information. We interpret the semantics of zooming operation with four-valued semantics based on partial interpretation and construct a deductive system with Belnap's four-valued logic. We also discuss an application with non-monotonic reasoning and paraconsistent logic using the zooming technique for frame problem.
Recently there has been increased interest in logicprogramming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is modelled by rules and ...
详细信息
ISBN:
(纸本)3540667490
Recently there has been increased interest in logicprogramming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. Historically the first logic in this class was Defeasible logic. In this paper we will study its relationship to other approaches which also rely on the idea of using logic rules and priorities. In particular we will study sceptical LPwNF, courteous logic programs, and priority logic.
Configurable on chip multiprocessor systems combine advantages of task-level parallelism and the flexibility Of field-programmable devices to customize architectures for parallel programs, thereby alleviating technolo...
详细信息
ISBN:
(纸本)9783642042379
Configurable on chip multiprocessor systems combine advantages of task-level parallelism and the flexibility Of field-programmable devices to customize architectures for parallel programs, thereby alleviating technological limitations due to memory bandwidth and power Consumption. Given the huge size of the design Space Of Such Systems, it is important to automatically optimize design parameters in order to facilitate wide and disciplined explorations. Being a combinatorial problem. system design can be modeled and solved as Such, but the amount of parameters renders the problem difficult to Solve for large instances. However. its the synthesis problem usually exhibits structure, Answer Set programming (ASP), for which solvers utilizing techniques from the propositional satisfiability domain are available, can be effectively employed. this paper presents a design flow based on ASP that uses the solver clasp as back-end engine. Synthesis experiments demonstrate the effectiveness of the approach.
We give a logicprogramming based account of probability and describe a declarative language P-log capable of reasoning which combines bothlogical and probabilistic arguments. Several non-trivial examples illustrate ...
详细信息
ISBN:
(纸本)354020721X
We give a logicprogramming based account of probability and describe a declarative language P-log capable of reasoning which combines bothlogical and probabilistic arguments. Several non-trivial examples illustrate the use of P-log for knowledge representation.
Modular nonmonotoniclogic programs (MLPs) under the answer-set semantics have been recently introduced as an ASP formalism in which modules can receive context-dependent input from other modules, while allowing (mutu...
详细信息
ISBN:
(纸本)9783642042379
Modular nonmonotoniclogic programs (MLPs) under the answer-set semantics have been recently introduced as an ASP formalism in which modules can receive context-dependent input from other modules, while allowing (mutually) recursive module calls. this call 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 all efficient top-down evaluation of MLPs, considering only calls to relevant module instances. To this end, we generalize the well-known Splitting theorem to the MLP setting and present notions of call stratification, for which we determine sufficient conditions. Call-stratified MLPs allow to split module instantiations into two parts, one for computing 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.
Partial equilibrium logic (PEL) is a new nonmonotonicreasoning formalism closely aligned withlogicprogramming under well-founded and partial stable model semantics. In particular it provides a logical foundation fo...
详细信息
Partial equilibrium logic (PEL) is a new nonmonotonicreasoning formalism closely aligned withlogicprogramming under well-founded and partial stable model semantics. In particular it provides a logical foundation for these semantics as well as an extension of the basic syntax of logic programs. In this paper we describe PEL, study some of its logical properties and examine its behaviour on disjunctive and nested logic programs. In addition we consider computational features of PEL and study different approaches to its computation.
To ensure a close relation between the answer sets of a program and those of its ground version, some answer set solvers deal with variables by requiring a safety condition on program rules. If we go beyond the syntax...
详细信息
ISBN:
(纸本)9783642042379
To ensure a close relation between the answer sets of a program and those of its ground version, some answer set solvers deal with variables by requiring 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 in quantified equilibrium logic where answer sets can be defined for arbitrary first-order formulas. the new concept captures and generalises two recently proposed safety definitions: that of Lee, Lifschitz and Palla (2008) as well as that of Bria, Faber and Leone (2008). We Study the main metalogical properties of safe formulas.
暂无评论