Semantic Web Service (SWS) composition is a challenging AI problem. We describe a theoretical and experimental framework based upon finite model search for constrained object models to address this problem. In many AI...
详细信息
Semantic Web Service (SWS) composition is a challenging AI problem. We describe a theoretical and experimental framework based upon finite model search for constrained object models to address this problem. In many AI situations the input is rather simple, and the results complex to obtain. SWS composition requests themselves can turn very complex, and the problem of building these requests can be viewed as an AI problem of its own. this paper presents an operational end to end approach to composing/publishing Semantic Web Services involving two main reasoning stages. Composing is first performed at the abstract level of goals (each roughly representing a discovery request), which yields a composition request at the workflow level. the resulting workflow is finally processed to generate a valid publishable semantic web service. We present experimental results obtained on industrial use cases during the DIP project.
the proceedings contain 8 papers. the topics discussed include: term indexing for the LEO-II Prover;integrating external deduction tools with ACL2;efficiently checking propositional resolution proofs in Isabelle/HOL;t...
the proceedings contain 8 papers. the topics discussed include: term indexing for the LEO-II Prover;integrating external deduction tools with ACL2;efficiently checking propositional resolution proofs in Isabelle/HOL;tableau decision procedure for propositional intuitionistic logic;LIFT-UP: lifted first-order planning under uncertainty;multiple preprocessing for systematic SAT solvers;implementing an instantiation-based theorem prover for first-order logic;and algorithms and data structures for first-order equational deduction.
the proceedings contain 38 papers. the topics discussed include: deciding satisfiability of positive second order joinability formulae;SAT solving for argument filterings;inductive decidability using implicit inductio...
详细信息
ISBN:
(纸本)3540482814
the proceedings contain 38 papers. the topics discussed include: deciding satisfiability of positive second order joinability formulae;SAT solving for argument filterings;inductive decidability using implicit induction;matching modulo superdevelopments applications to second-order matching;a characterization of alternating log time by first order functional programs;combining typing and size constraints for checking the termination of higher-order conditional rewrite systems;on a local-step cut-elimination procedures for the intuitionistic sequent calculus;branching-time temporal logic extended with qualitative Presburger constraints;combining supervaluation and degree based reasoning under vagueness;a local system for intuitionistic logic;reducing nondeterminism in the calculus of structures;a relaxed approach to integrity and inconsistency in databases;on locally checkable properties;and deciding key cycles for security protocols.
P-log is a probabilistic logicprogramming language, which combines bothlogicprogramming style knowledge representation and probabilistic reasoning. In earlier papers various advantages of P-log have been discussed....
详细信息
P-log is a probabilistic logicprogramming language, which combines bothlogicprogramming style knowledge representation and probabilistic reasoning. In earlier papers various advantages of P-log have been discussed. In this paper we further elaborate on the KR prowess of P-log by showing that: (i) it can be used for causal and counterfactual reasoning and (ii) it provides an elaboration tolerant way for non-naive conditioning.
In this paper we introduce a multi-context variant of Reiter's default logic. the logic provides a syntactical counterpart of Roelofsen and Serafini's information chain approach (IJCAI-05), yet has several adv...
详细信息
In this paper we introduce a multi-context variant of Reiter's default logic. the logic provides a syntactical counterpart of Roelofsen and Serafini's information chain approach (IJCAI-05), yet has several advantages: it is closer to standard ways of representing nonmonotonic inference and a number of results from that area come "for free";it is closer to implementation, in particular the restriction to logicprogramming gives us a computationally attractive framework;and it allows us to handle a problem withthe information chain approach related to skeptical reasoning.
Although epistemic logicprogramming has an enhanced capacity to handle complex incomplete information reasoning and represent agents' epistemic behaviours, it embeds a significantly higher computational complexit...
详细信息
Although epistemic logicprogramming has an enhanced capacity to handle complex incomplete information reasoning and represent agents' epistemic behaviours, it embeds a significantly higher computational complexity than non-disjunctive and disjunctive answer set programming. In this paper, we investigate some important properties of epistemic logic programs. In particular, we show that Lee and Lifschitz's result on loop formulas for disjunctive logic programs can be extended to a special class of epistemic logic programs. We also study the polysize model property for epistemic logic programs. Based on these discoveries, we identify two non-trivial classes of epistemic logic programs whose consistency checking complexity is reduced from PSPACE-complete to NP-complete and Sigma(P)(2)-complete respectively. We observe that many important applications on epistemic representation fall into these two classes of epistemic logic programs.
In the area of Description logic (DL) based knowledge representation, hybrid terminologies have been proposed as a means to make non-standard inference services available to knowledge bases that contain general concep...
详细信息
ISBN:
(纸本)9783540755586
In the area of Description logic (DL) based knowledge representation, hybrid terminologies have been proposed as a means to make non-standard inference services available to knowledge bases that contain general concept inclusion (GCI) axioms. Building on existing work on subsumption in hybrid terminologies, the present paper provides the first in-depth investigation of the non-standard inferences least-common subsumer, and matching in hybrid epsilon L-TBoxes;providing sound and complete algorithms for both inference services.
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof nets, that is a correctness criterion...
详细信息
ISBN:
(纸本)9783540755586
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof nets, that is a correctness criterion (an algorithm) for checking those proof structures which correspond to proofs of the purely multiplicative and additive fragment of linear logic. this criterion is formulated in terms of simple graph rewriting rules and it extends an initial idea of a retraction correctness criterion for proof nets of the purely multiplicative fragment of linear logic presented by Danos in his thesis in 1990.
暂无评论