| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910453264703321 |
|
|
Autore |
Gómez-Pérez José Manuel |
|
|
Titolo |
Acquisition and understanding of process knowledge using problem solving methods / / José Manuel Gómez-Pérez |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Heidelberg, Germany : , : IOS Press : , : AKA, , 2010 |
|
©2010 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (154 p.) |
|
|
|
|
|
|
Collana |
|
Studies on the Semantic Web, , 1868-1158 ; ; Volume 007 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Knowledge acquisition (Expert systems) |
Problem solving - Data processing |
Electronic books. |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references. |
|
|
|
|
|
|
Nota di contenuto |
|
Title Page; List of figures; List of Tables; Contents; Introduction; State of the Art; The Knowledge Acquisition Bottleneck; From Mining to Modelling: The Knowledge Level; Ontologies and Problem Solving Methods in the Knowledge Acquisition Modelling Paradigm; Knowledge Acquisition by Knowledge Engineers; Knowledge Acquisition by Subject Matter Experts; Process Knowledge and Subject Matter Experts; The Process Knowledge Lifecycle; Conclusions; Work Objectives; Goals and Open Research Problems; Contributions to the State of the Art; Work Assumptions, Hypotheses, and Restrictions |
Acquisition of Process Knowledge by SMEsIntroduction; Knowledge Acquisition and Formulation by SMEs in the Halo Project; Knowledge Types in Scientific Disciplines; Domain Analysis; A Comprehensive Set of Knowledge Types in Scientific Disciplines; The Process Metamodel; Process Entities in the Process Metamodel; Problem Solving Methods for the Acquisition of Process Knowledge; A PSM Modelling Framework for Processes; A Method to Build a PSM Library of Process Knowledge; A PSM Library for the Acquisition of Process Knowledge; Enabling SMEs to Formulate Process Knowledge |
The DarkMatter Process EditorRelated Work; Representing and Reasoning with SME-authored Process Knowledge; A Formalism for Representing and Reasoning with Process Knowledge; F-logic as |
|
|
|
|
|
|
|
|
|
|
|
Process Representation and Reasoning Language; The Process Frame; Code Generation for Process Knowledge; Synthesis of precedence rules for data flow management; Code Synthesis for Iterative Actions; Soundness and Completeness of Process Models; Optimization of the Synthesized Process Code; Reasoning with Process Models; Analysis of Process Executions by SMEs; Towards Knowledge Provenance in Process Analysis |
Problem Solving Methods for the Analysis of Process ExecutionsA Knowledgeoriented Provenance Environment; An Algorithm for Process Analysis Using PSMs; Evaluation; Evaluation of the DarkMatter Process Component for Acquisition of Process Knowledge by SMEs; Evaluation Syllabus; Distribution of the Formulated Processes across the Evaluation Syllabus; Utilization of the PSM Library and Process Metamodel; Usage Experience of the SMEs with the Process Editor; Performance Evaluation of the Process Component; Evaluation of KOPE for the Analysis of Process Executions by SMEs; Evaluation Settings |
Evaluation MetricsEvaluation Results; Evaluation Conclusions; Conclusions and Future Research; Conclusions; Future Research Problems; REFERENCES; Appendix. Sample F-logic Code for a Process Model |
|
|
|
|
|
|
Sommario/riassunto |
|
The development of knowledge-based systems is usually approached through the combined skills of knowledge engineers (KEs) and subject matter experts (SMEs). One of the most critical steps in this activity aims at transferring knowledge from SMEs to formal, machine-readable representations, which allow systems to reason with such knowledge. However, this is a costly and error prone task. Alleviating the knowledge acquisition bottleneck requires enabling SMEs with the means to produce the desired knowledge representations without the help of KEs. This is especially difficult in the case of compl |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910144921603321 |
|
|
Titolo |
Logical Foundations of Computer Science : 4th International Symposium, LFCS'97, Yaroslavl, Russia, July, 6 - 12, 1997, Proceedings / / edited by Sergei Adian, Anil Nerode |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1997.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (IX, 436 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 1234 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computers |
Logic, Symbolic and mathematical |
Computer logic |
Theory of Computation |
Mathematical Logic and Formal Languages |
Logics and Meanings of Programs |
Mathematical Logic and Foundations |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
Topological semantics for hybrid systems -- Domain-free pure type systems -- Generic queries over quasi-o-minimal domains -- Towards computing distances between programs via Scott domains -- A safe recursion scheme for exponential time -- Finite model theory, universal algebra and graph grammars -- Complexity of query answering in logic databases with complex values -- Recognition of deductive data base stability -- The concurrency complexity for the Horn fragment of linear logic -- Studying algorithmic problems for free semi-groups and groups -- Learning small programs with additional information -- Cut elimination for the second order propositional logic with Hilbert's ?-symbol, extensionality, and full comprehension -- Finite bases of admissible rules for the logic S52 C -- An algebraic correctness criterion for intuitionistic proof-nets -- Towards a theory of recursive structures -- On the complexity of prefix formulas in modal logic of subset spaces -- The undecidability of second order linear affine logic |
|
|
|
|
|
|
|
|
|
|
|
-- Operational logic of proofs with functionality condition on proof predicate -- On linear ordering of strongly extensional finitely-branching graphs and non-well-founded sets -- Functions for the general solution of parametric word equations -- A proof procedure for hereditary Harrop formulas with free equality -- Basic forward chaining construction for logic programs -- Decidability and undecidability of the halting problem on Turing machines, a survey -- Case study: Additive linear logic and lattices -- Some decision problems for traces -- Existential instantiation and strong normalization -- Models for the logic of proofs -- Interpretation of the full computation tree logic CTL* on sets of infinite sequences -- Type introduction for equational rewriting -- Capturing bisimulation-invariant Ptime -- Equivalence of multiplicative fragments of cyclic linear logic and noncommutative linear logic -- A decidable fragment of second order linear logic -- Some results on Propositional Dynamic Logic with fixed points -- Quasi-characteristic inference rules for modal logics -- Provability logic with operations on proofs -- Formal verification of logic programs: Foundations and implementation -- Unification of terms with term-indexed variables -- Back-forth equivalences for design of concurrent systems -- Association nets: An alternative formalization of common thinking -- Simulating ?-expansions with ?-reductions in the second-order polymorphic ?-rcalculus -- Logical schemes for first order theories -- Verification of PLTL formulae by means of monotone disjunctive normal forms. |
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the 4th International Symposium on Logical Foundations of Computer Science, LFCS'97, held in Yaroslavl, Russia, in July 1997. The volume presents 42 revised refereed papers carefully selected by the program committee. All current issues of computer science logic are addressed. There is a certain emphasis on reporting the progress achieved by scientists from various parts of the former Soviet Union; but there are also many other strong papers from the international research community. |
|
|
|
|
|
|
|
| |