Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
Type of Medium
Language
Region
Access
  • 1
    UID:
    b3kat_BV024648190
    Format: X, 382 S.
    Series Statement: Symbolic computation
    Language: Undetermined
    Subjects: Computer Science , Comparative Studies. Non-European Languages/Literatures
    RVK:
    RVK:
    Keywords: PROLOG ; Beispielsammlung ; Beispielsammlung ; Beispielsammlung
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Berlin, Heidelberg : Springer Berlin Heidelberg
    UID:
    gbv_775328626
    Format: Online-Ressource (XV, 293p) , online resource
    Edition: Fifth Edition
    Edition: Springer eBook Collection. Computer Science
    ISBN: 9783642554810
    Content: Originally published in 1981, this was the first textbook on programming in the Prolog language and is still the definitive introductory text on Prolog. Though many Prolog textbooks have been published since, this one has withstood the test of time because of its comprehensiveness, tutorial approach, and emphasis on general programming applications. Prolog has continued to attract a great deal of interest in the computer science community, and has turned out to be the basis for an important new generation of programming languages and systems for Artificial Intelligence. Since the previous edition of Programming in Prolog, the language has been standardised by the International Organization for Standardization (ISO) and this book has been updated accordingly. The authors have also introduced some new material, clarified some explanations, corrected a number of minor errors, and removed appendices about Prolog systems that are now obsolete
    Note: 1 Tutorial IntroductionGives the student a feel for what it is like to program in Prolog. Introduces objects, relationships, facts, rules, variables -- 1.1 Prolog -- 1.2 Objects and Relationships -- 1.3 Programming -- 1.4 Facts -- 1.5 Questions -- 1.6 Variables -- 1.7 Conjunctions -- 1.8 Rules -- 1.9 Summary and Exercises -- 2 A Closer Look -- More detailed presentation of Prolog syntax and data structures -- 2.1 Syntax -- 2.2 Characters -- 2.3 Operators -- 2.4 Equality and Unification -- 2.5 Arithmetic -- 2.6 Summary of Satisfying Goals -- 3 Using Data Structures -- Representing objects and relationships by using trees and lists. Developing several standard Prolog programming techniques -- 3.1 Structures and Trees -- 3.2 Lists -- 3.3 Recursive Search -- 3.4 Mapping -- 3.5 Recursive Comparison -- 3.6 Joining Structures Together -- 3.7 Accumulators -- 3.8 Difference Structures -- 4 Backtracking and the “Cut” -- How a set of clauses generates a set of solutions. Using “cut” to modify the control sequence of running Prolog programs -- 4.1 Generating Multiple Solutions -- 4.2 The “Cut” -- 4.3 Common Uses of the Cut -- 4.4 Problems with the Cut -- 5 Input and Output -- Facilities available for the input and output of characters and structures. Developing a program to read sentences from the user and represent the structure as a list of words, which can be used with the Grammar Rules of Chapter -- 5.1 Reading and Writing Terms -- 5.2 Reading and Writing Characters -- 5.3 Reading English Sentences -- 5.4 Reading and Writing Files -- 5.5 DeclaringOperators -- 6 Built-in Predicates -- Definition of the “core” built-in predicates, with sensible examples of how each one is used. By this point, the reader should be able to read reasonably complex programs, and should therefore be able to absorb the built-in predicates by seeing them in use -- 6.1 EnteringNew Clauses -- 6.2 Success and Failure -- 6.3 Classifying Terms -- 6.4 Treating Clauses as Terms -- 6.5 Constructing and Accessing Components of Structures -- 6.6 Affecting Backtracking -- 6.7 Constructing Compound Goals -- 6.8 Equality -- 6.9 Input and Output -- 6.10 Handling Files -- 6.11 Evaluating Arithmetic Expressions -- 6.12 Comparing Terms -- 6.13 Watching Prolog atWork -- 7 More Example Programs -- Many example programs are given, covering a wide range of interests. Examples include list processing, set operations, symbolic differentiation and simplification of formula -- 7.1 A Sorted Tree Dictionary -- 7.2 Searching a Maze -- 7.3 The Towers of Hanoi -- 7.4 Parts Inventory -- 7.5 List Processing -- 7.6 Representing andManipulating Sets -- 7.7 Sorting -- 7.8 Using the Database -- 7.9 SearchingGraphs -- 7.10 Sift the Two’s and Sift the Three’s -- 7.11 Symbolic Differentiation -- 7.12 Mapping Structures and Transforming Trees -- 7.13 Manipulating Programs -- 7.14 Bibliographic Notes -- 8 Debugging Prolog Programs -- By this point, the reader will be able to write reasonable programs, and so the problem of debugging will be relevant. Flow of control model, hints about common bugs, techniques of debugging. -- 8.1 Laying out Programs -- 8.2 Common Errors -- 8.3 The Tracing Model -- 8.4 Tracing and Spy Points -- 8.5 Fixing Bugs -- 9 Using Prolog Grammar Rules -- Applications of existing techniques. Using Grammar Rules. Examining the design decisions for some aspects of analysing natural language with Grammar Rules -- 9.1 The Parsing Problem -- 9.2 Representing the Parsing Problemin Prolog -- 9.3 The Grammar Rule Notation -- 9.4 Adding ExtraArguments -- 9.5 Adding Extra Tests -- 9.6 Summary -- 9.7 Translating Language into Logic -- 9.8 More General Use of Grammar Rules -- 10 The Relation of Prolog to Logic -- Predicate Calculus, clausal form, resolution theorem proving, logic programming -- 10.1 Brief Introduction to Predicate Calculus -- 10.2 Clausal Form -- 10.3 A Notation for Clauses -- 10.4 Resolution and Proving Theorems -- 10.5 Horn Clauses -- 10.6 Prolog -- 10.7 Prolog and Logic Programming -- 11 Projects in Prolog -- A selection of suggested exercises, projects and problems -- 11.1 Easier Projects -- 11.2 Advanced Projects -- A Answers to Selected Exercises -- B Clausal Form Program Listings -- C Writing Portable Standard Prolog Programs -- The Prolog standard, writing portable programs and dealing with different Prolog implementations -- C.1 Standard Prolog for Portability -- C.2 Different Prolog Implementations -- C.3 Issues to LookOut For -- C.4 Definitions of some Standard Predicates -- C.4.1 Character Processing -- C.4.2 Directives -- C.4.3 Stream Input/Output -- C.4.4 Miscellaneous -- D CodetoSupport DCGs -- D.1 DCG Support Code.
    Additional Edition: ISBN 9783540006787
    Additional Edition: Erscheint auch als Druck-Ausgabe Clocksin, William F., 1955 - Programming in Prolog Berlin : Springer, 2003 ISBN 3540006788
    Additional Edition: ISBN 9783540006787
    Additional Edition: ISBN 0387006788
    Language: English
    Subjects: Computer Science , Economics , Comparative Studies. Non-European Languages/Literatures
    RVK:
    RVK:
    RVK:
    RVK:
    RVK:
    Keywords: PROLOG ; PROLOG
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    gbv_595126995
    Format: Online-Ressource (X, 324 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540473121
    Series Statement: Lecture notes in computer science 636
    Content: Theory and practice in logic programming -- Constraint Logic Programming -- Scheduling and optimisation in the Automobile Industry -- Factory scheduling using finite domains -- The Prince project and its applications -- A (Gentle) introduction to deductive databases -- Knowledge based PPS applications in PROTOS-L -- The SECReTS banking expert system from phase 1 to phase 2 -- Logic engineering and clinical dilemmas -- A knowledge-based approach to strategic planning -- Expert systems in mining -- Natural and formal language processing -- PUNDIT — Natural language interfaces -- The Esteam-316 dialogue manager -- Legislation as logic programs -- Knowledge representation for natural language processing -- A set of tools for VHDL design -- Tutorial notes: Reasoning about logic programs -- Software formal specification by logic programming: The example of standard Prolog -- The art of computer un-programming: Reverse engineering in Prolog -- Opium — An advanced debugging system -- Automatic theorem proving within the portable AI Lab.
    Content: Logic programming enjoys a privileged position. It is firmly rooted in mathematical logic, yet it is also immensely practical, as a growing number of users in universities, research institutes, and industry are realizing. Logic programming languages, specifically Prolog, have turned out to be ideal as prototyping and application development languages. This volume presents the proceedings of the Second Logic Programming Summer School, LPSS'92. The First Logic Programming Summer School, LPSS '90, addressed the theoretical foundations of logic programming. This volume focuses onthe relationship between theory and practice, and on practical applications. The introduction to the volume is by R. Kowalski, one of the pioneers in the field. The following papers are organized into sections on constraint logic programming, deductive databases and expert systems, processing of natural and formal languages, software engineering, and education.
    Note: Literaturangaben
    Additional Edition: ISBN 3540559302
    Additional Edition: ISBN 9783540559306
    Additional Edition: Druckausg. Logic programming in action Berlin : Springer, 1992 ISBN 3540559302
    Additional Edition: ISBN 0387559302
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    Keywords: Logische Programmierung ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    gbv_595131344
    Format: Online-Ressource (XIV, 455 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540393078
    Series Statement: Lecture notes in computer science 186
    Content: On the relevance of formal methods to software development -- Combining algebraic and predicative specifications in Larch -- The role of proof obligations in software design -- Functional semantics of modules -- Intuition in software development -- A rational design process: How and why to fake it -- Formalization in systems development -- Specifying and prototyping: Some thoughts on why they are successful -- A formal specification of line representations on graphics devices -- Experiences with the PSG — Programming System Generator -- Software construction using typed fragments -- Graph grammar engineering: A method used for the development of an integrated programming support environment -- Multidimensional tree-structured file spaces -- A theory of abstract data types for program development: Bridging the gap? -- Program development and documentation by informal transformations and derivations -- ASSPEGIQUE: An integrated environment for algebraic specifications -- Application of PROLOG to test sets generation from algebraic specifications -- A PROLOG environment for developing and reasoning about data types -- Algebraic specification of synchronisation and errors: A telephonic example -- Modelling concurrent modules -- Synthesis of parallel programs invariants -- Analyzing safety and fault tolerance using Time Petri nets -- Algebraic specification of a communication scheduler -- The integration and distribution phase in the software life cycle -- Formalized software development in an industrial environment -- Object oriented concurrent programming and industrial software production -- Experience of introducing the Vienna development method into an industrial organisation -- EDP system development methodology: Auditability and control -- Experiences with object oriented programming.
    Note: Literaturangaben
    Additional Edition: ISBN 3540151990
    Additional Edition: ISBN 0387151990
    Additional Edition: ISBN 9783540151999
    Additional Edition: Druckausg. Formal methods and software development Berlin : Springer, 1985 ISBN 3540151990
    Additional Edition: ISBN 0387151990
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Softwareentwicklung ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    gbv_595128793
    Format: Online-Ressource (XVI, 688 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540471714
    Series Statement: Lecture notes in computer science 449
    Content: A theorem prover for a computational logic -- A complete semantic back chaining proof system -- Parallelizing the closure computation in automated deduction -- Partheo: A high-performance parallel theorem prover -- Substitution-based compilation of extended rules in deductive databases -- Automatic theorem proving in paraconsistent logics: Theory and implementation -- Case-free programs: An abstraction of definite horn programs -- Generalized well-founded semantics for logic programs -- Tactical theorem proving in program verification -- Extensions to the rippling-out tactic for guiding inductive proofs -- Guiding induction proofs -- Term rewriting induction -- A resolution principle for clauses with constraints -- Str+ve USDUSD\subseteqUSDUSD : The Str+ve-based subset prover -- Ritt-Wu's decomposition algorithm and geometry theorem proving -- Encoding a dependent-type ?-calculus in a logic programming language -- Investigations into proof-search in a system of first-order dependent function types -- Equality of terms containing associative-commutative functions and commutative binding operators is isomorphism complete -- An improved general E-unification method -- Some results on equational unification -- Unification in a combination of equational theories: an efficient algorithm -- SLIM: An automated reasoner for equivalences, applied to set theory -- An examination of the prolog technology theorem-prover -- Presenting intuitive deductions via symmetric simplification -- Toward mechanical methods for streamlining proofs -- Ordered rewriting and confluence -- Complete sets of reductions with constraints -- Rewrite systems for varieties of semigroups -- Improving associative path orderings -- Perspectives on automated deduction -- On restrictions of ordered paramodulation with simplification -- Simultaneous paramodulation -- Hyper resolution and equality axioms without function substitutions -- Automatic acquisition of search guiding heuristics -- Automated reasoning contributes to mathematics and logic -- A mechanically assisted constructive proof in category theory -- Dynamic logic as a uniform framework for theorem proving in intensional logic -- A tableaux-based theorem prover for a decidable subset of default logic -- Computing prime implicants -- Minimizing the number of clauses by renaming -- Higher order E-unification -- Programming by example and proving by example using higher-order unification -- Retrieving library identifiers via equational matching of types -- Unification in monoidal theories -- A science of reasoning: Extended abstract -- The TPS theorem proving system -- Schemata -- Cylindric algebra equation solver -- The OYSTER-CLAM system -- A high-performance parallel theorem prover -- The romulus proof checker -- IMPS : An interactive mathematical proof system -- UNICOM: A refined completion based inductive theorem prover -- The theorem prover of the program verifier Tatzelwurm -- RCL: A lisp verification system -- Orme an implementation of completion procedures as sets of transitions rules -- Otter 2.0 -- Dissolver: A dissolution-based theorem prover -- TRIP: An implementation of clausal rewriting -- OSCAR -- Expert thinker: An adaptation of F-Prolog to microcomputers -- A prolog technology theorem prover -- A general clause theorem prover -- Liss — The logic inference search system -- ACE: The abstract clause engine -- Tutorial on high-performance automated theorem proving -- Tutorial on reasoning and representation with concept languages -- Tutorial on ?Prolog -- Tutorial on equational unification -- Tutorial on compilation techniques for logics -- Tutorial on high-performance theorem provers: Efficient implementation and parallelisation -- Tutorial on rewrite-based theorem proving -- Tutorial on program-synthetic deduction -- Tutorial on computing models of propositional logics.
    Content: This volume contains the papers presented at the 10th International Conference on Automated Deduction (CADE-10). CADE is the major forum at which research on all aspects of automated deduction is presented. Although automated deduction research is also presented at more general artificial intelligence conferences, the CADE conferences have no peer in the concentration and quality of their contributions to this topic. The papers included range from theory to implementation and experimentation, from propositional to higher-order calculi and nonclassical logics; they refine and use a wealth of methods including resolution, paramodulation, rewriting, completion, unification and induction; and they work with a variety of applications including program verification, logic programming, deductive databases, and theorem proving in many domains. The volume also contains abstracts of 20 implementations of automated deduction systems. The authors of about half the papers are from the United States, many are from Western Europe, and many too are from the rest of the world. The proceedings of the 5th, 6th, 7th, 8th and 9th CADE conferences are published as Volumes 87, 138, 170, 230, 310 in the series Lecture Notes in Computer Science.
    Note: Literaturangaben
    Additional Edition: ISBN 3540528857
    Additional Edition: ISBN 9783540528852
    Additional Edition: Druckausg. International Conference on Automated Deduction (10 : 1990 : Kaiserslautern) Proceedings Berlin : Springer, 1990 ISBN 3540528857
    Additional Edition: ISBN 0387528857
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Automatisches Beweisverfahren ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    gbv_595129730
    Format: Online-Ressource (X, 389 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540461180
    Series Statement: Lecture notes in computer science 352
    Content: Towards a meaning of ‘M’ in VDM -- Algebraic specification and functionals for transformational program and meta program development -- On the use of specification styles in the design of distributed systems -- Specifying Avalon objects in Larch -- A self-applicable partial evaluator for term rewriting systems -- Verifying correctness of logic programs -- Specifying the behavior of graphical objects using Esterel -- A preprocessor based module system for Prolog -- Formulas, processes, and Petri-Nets applied to the specification and verification of a HDLC protocol -- Compilation of lambda-calculus into functional machine code -- Polymorphic subtype inference: Closing the theory-practice gap -- FACILE: A symmetric integration of concurrent and functional programming -- Development of concurrent programs: An example -- Horn clause programs with polymorphic types: Semantics and resolution -- Type checking, universe polymorphism, and typical ambiguity in the calculus of constructions draft -- Is type checking practical for system configuration? -- An introduction to PSFd -- Processes and functions -- Binding time analysis for polymorphically typed higher order languages -- A fine grain parallel implementation of PARLOG -- Specification and verification of TCSP systems by means of partial abstract data types -- LEAP: A language with eval and polymorphism -- The semantics of program slicing and program integration -- Toward formal development of ML programs: Foundations and methodology.
    Content: TAPSOFT '89 is the Third International Joint Conference on Theory and Practice of Software Development held in Barcelona, Spain, March 13-17, 1989. The conference consissted of three parts: - Advanced Seminar on Foundations of Innovative Software Development - Colloquium on Trees in Algebra and Programming (CAAP '89) - Colloquium on Current Issues in Programming Languages (CCIPL) The TAPSOFT '89 Conference Proceedings are published in two volumes. The first volume includes the papers from CAAP plus the more theoretical ones of the invited papers. The second volume comprises the papers from CCIPL and the invited papers more relevant to current issues in programming languages.
    Note: Literaturangaben
    Additional Edition: ISBN 3540509402
    Additional Edition: ISBN 0387509402
    Additional Edition: ISBN 9783540509400
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783662162149
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783540509400
    Language: English
    Keywords: Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    UID:
    gbv_595129382
    Format: Online-Ressource (VI, 496 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540467236
    Series Statement: Lecture notes in computer science 387
    Content: Software risk management -- MENU - an example for the systematic reuse of specifications -- Asking for the impossible: The state of the art in safety-related systems -- STEPS to software development with users -- The role of measurement in ISEEs -- An empirical and theoretical analysis of an information flow-based system design metric -- Systematic development of formal software process models -- Software process machines: A framework for future software development environments -- Practical experience of formal specification: A programming interface for communications -- Industrialising formal methods for telecommunications -- An application of the event calculus for representing the history of a software project -- Change oriented versioning -- Software change dynamics or half of all Ada compilations are redundant -- Version management in the PACT integrated software engineering environment -- Software engineering implications for formal refinement -- A rigorous development strategy using the OBJ specification language and the MALPAS program analysis tools -- Formal specification using structured systems analysis -- Tool integration in an open environment -- HCDM/GSDS — A design environment for real-time software with automatic program generation -- Graph grammars, a new paradigm for implementing visual languages -- Structural modelling of Prolog for metrication -- Rule-based handling of software quality and productivity models -- An object-oriented approach to the system analysis -- A pluralistic knowledge-based approach to software specification -- PROTOB a hierarchical object-oriented CASE tool for distributed systems -- The internet worm incident -- Validation of concurrent Ada™ programs using symbolic execution -- Assay-a tool to support regression testing.
    Content: The book is concerned with the broad topic of software engineering. It comprises the proceedings of the European Software Engineering Conference (ESEC) held at the University of Warwick in the United Kingdom in September 1989 and its primary purpose is to summarise the state of the art in software engineering as represented by the papers at that conference. The material covers both submitted papers and a number of invited papers given at the conference. The topics covered include: metrics and measurement, software process modelling, formal methods including their use in industry, software configuration management, software development environments, and requirements engineering. The book is most likely to be of interest to researchers and professionals working in the field of software development. The primary value of the book is that it gives an up-to-date treatment of its subject material and includes some interesting discussions of the transfer of research ideas into industrial practice.
    Note: Literaturangaben
    Additional Edition: ISBN 3540516352
    Additional Edition: ISBN 9783540516354
    Additional Edition: Druckausg. ESEC (2 : 1989 : Coventry) ESEC '89 Berlin [u.a.] : Springer, 1989 ISBN 3540516352
    Additional Edition: ISBN 0387516352
    Language: English
    Keywords: Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    UID:
    gbv_595127320
    Format: Online-Ressource (X, 615 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540472216
    Series Statement: Lecture notes in computer science 602
    Content: Why hypermedia systems are important -- Project CALC: Calculus as a laboratory course -- The structures of advanced multimedia learning environments: Reconfiguring space, time, story, and text -- Adjusting to the paradim shift in teaching and learning or what do I do now??? -- Engagement and construction: Educational strategies for the post-TV era -- Building knowledge based tutors -- Learning styles and computer-based learning environments -- Text and graphics in instructional design -- Assessing program visualization systems as instructional aids -- At last! A computer aid for the teaching of electronics which answers all the nagging questions about capacitors -- An object oriented approach to produce educational hypermedia software -- A cognitive model of programming knowledge for procedural languages -- Programming by experimentation and example -- An experiment of cooperative learning with Hypercard -- An ITS for engineering domains concept, design and application -- Structuring the subject matter -- MIDI draw: Designing an impressionistic medium for young musicians, artists, and writers -- Standardized architecture for integrated open courseware -- Formal techniques in higher education: A proposal -- QUIZ, a distributed intelligent tutoring system -- Intelligent tutorial system in medicine through an interactive testing program: HyperMIR -- DCE: A knowledge-based tutoring and advisory system - Tutoring strategies and architecture -- Discourse style and situation viewpoint for a conversational language tutor -- Open structured CAI system for Kanji learning -- The sum of the parts is greater than the whole in online graduate education -- Development of GeoBlock: a micro-world for learning and teaching geometry -- SODA: A computer-aided design environment for the doing and learning of software design -- A graphical CAL author language -- A knowledge base approach to learning to program in Prolog -- Self-adjusting curriculum planning in Sherlock II -- Integrating an educational simulation into a Logic Design course -- An algorithm animation programming environment -- ABASE: A Hypermedia-based tutoring and authoring system -- A tool for developing intelligent tutoring systems -- Applying computer models of phonological competence to C.A.L.L. -- Vigilance in a long-term cognitive computing task: The effects of subject strategy and screen colour on performance -- Mastering the machine: A comparison of the mouse and touch screen for children's use of computers -- An authoring system for ITS which is based on a generic level of tutoring strategies -- The uses of multiple student inputs in modeling and lesson planning in CAI and ICAI programs -- Project Nestor: New approaches to cooperative multimedia authoring/learning -- Design and implementation of courseware for teaching programming languages -- Objector, yet another authoring system -- Design and evaluation of the SUMIT intelligent teaching assistant for arithmetic -- Spelling remediation for dyslexic children using the selfspell programs -- Using HyperCard to create a flexible learning package for statistics: Costs, benefits and effectiveness -- Educational software engineering: A methodology based on cooperative developments -- Environmental CAL for conversation pattern learning -- Adaptive navigational tools for educational hypermedia -- A tool for storing and exploring ideas -- Dynamic CAL-courseware generation within an ITS-shell architecture -- Callguide: using programmable hypertext as a shell for Call programs.
    Content: ICCAL, the International Conference on Computers and Learning, is a forum for the exchange of ideas and presentation of developments in the theory andpractice of computer uses in education, with a focus on post-secondary education. ICCAL '92 was held at Acadia University in Wolfville, Nova Scotia, Canada, June 17-20, 1992. This volume presents the proceedings of ICCAL '92, and features 45 submitted and 6 invited papers. Topics addressed include hypermedia systems, multimedia learning environments, educational strategies, knowledge based tutors, program visualization systems, intelligent tutoring systems, mouse and touchscreen comparison, cooperative multimedia, authoring systems, language learning, spelling remediation, teaching geometry, a tutoring assistant for arithmetic, a learning package for statistics, conversational pattern learning, adaptive navigational tools, and many more.
    Note: Literaturangaben
    Additional Edition: ISBN 3540555781
    Additional Edition: ISBN 9783540555780
    Additional Edition: Druckausg. Computer assisted learning Berlin : Springer, 1992 ISBN 3540555781
    Additional Edition: ISBN 0387555781
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    Keywords: Computerunterstütztes Lernen ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    UID:
    gbv_595131174
    Format: Online-Ressource (XVI, 650 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540396857
    Series Statement: Lecture notes in computer science 204
    Content: Algorithms for polynomial division -- Sparse hensel lifting -- Heugcd: How elementary upperbounds generate cheaper data -- Gaussian elimination over a euclidean ring -- Demonstration of reduce3 as implemented on a stand-alone Motorola 68000 based microcomputer -- The Scratchpad II computer algebra language and system -- The SAC-2 computer algebra system -- DOE-MACSYMA: Progress report -- Towards practical implementations of syllogistic -- Path resolution and semantic graphs -- Fast subsumption algorithms -- Substitution expressions: Extracting solutions of non-Horn clause proofs -- The complexity of elementary problems in archimedean ordered groups -- Progress on the equivalence problem -- Symbol representations of noncommutative algebras -- Algebraic computations in elementary catastrophe theory -- Bifurcation theory and computer algebra: An initial approach -- Factorization of polynomials by transcendental evaluation -- Factorization of rational polynomials in the Zassenhaus — Norm -- On decomposable and commuting polynomials -- Fast polynomial decomposition algorithms -- A program system for root finding -- A program system for factorization of polynomials with rational coefficients -- THKLISP as a base of formula manipulation systems -- AMP a system for algebraic computations -- The program ortocartan for applications in Einstein's relativity theory -- Sheep and classification in general relativity -- Norcan — A computer calculus program -- Demo of stensor -- Visual environments for symbolic computation -- Syntactic equivalences inducing semantic equivalences -- The Algos computational system -- Retrieval in a module library using formal specifications: Preliminary search using syntactic properties -- The J-Machine: Functional programming with combinators -- Symbolic algebra in problems of nonlinear mechanics -- Macsyma's computation of dirac-bergmann algorithm for Hamiltonian syytems with constraints -- Infinite dimensional computer Lie algebra ? -- Application of computer algebra to the theory of the vibration-rotational spectra of diatomic molecules -- Algorithms for the character theory of the symmetric group -- Worst-case analysis of algorithms for computational problems on abelian permutation groups -- A completion of some coxeter groups -- A CAYLEY file of finite simple groups -- On some laws in PSL(2,q) -- An adjacency algorithm for cylindrical algebraic decompositions of three-dimensional space -- A cluster-based cylindrical algebraic decomposition algorithm -- On mechanical quantifier elimination for elementary algebra and geometry: Solution of a nontrivial problem -- Gröbner bases using SAC2 -- A polynomial-time algorithm for the topological type of a real algebraic curve -- An improved projection operation for cylindrical algebraic decomposition -- Arithmetic in quadratic fields with unique factorization -- About a new method for computing in algebraic number fields -- An algebraic implementation of packages -- The SMP pattern matcher -- An expression compression package for REDUCE based on factorization and controlled expansion -- STENSOR uses disc automatically for very large computations -- Numerical methods with automatic verification -- ACRITH — High accuracy arithmetic subroutine library -- Floating-point computation in PASCAL-SC with verified results -- PASCAL-SC demonstration accurate arithmetic for verified results -- A solution to the polynomial hensel-code conversion problem -- A posteriori interval analysis -- Symbolic manipulations on a computer and their application to generation and investigation of difference schemes -- Completeness in data type specifications -- On solving the equality problem in theories defined by Horn clauses -- Reducing the complexity of the Knuth-Bendix completion algorithm: A "unification" of different approaches -- A confluence criterion based on the generalised Newman Lemma -- ERIL — Equational reasoning: an interactive laboratory -- Implementation of a general completion procedure parameterized by built-in theories and strategies -- Computer algebra in Norway -- Goppa codes: Algorithmic problems -- Gcd's and factoring multivariate polynomials using Grobner bases -- A note on the complexity of constructing standard bases -- Some algorithmic questions on ideals of differential operators -- Obtaining complete sets of reductions and equations without using special unification algorithms -- An overview of completion algorithms -- The optimisation by "code motion" of user programs for an algebraic manipulation system -- An improved plotting package for VAXIMA -- On logic programs with data-driven computations -- Darwin, a system designed for the study of enumerative combinatorics -- Correctness proofs of the implementation of abstract data types -- Using prolog for constructing geometric objects defined by constraints -- The role of symbolic computation in the management of scientific information -- CIM (computer integrated manufacturing) — A challenge for symbolic computation -- Symbolic and algebraic computation may support secondary education -- Software toolkit for input stage measurement in symbolic compuation -- The algebraic manipulation systems on the electrical power systems -- A new method of computing fundamental units in algebraic number fields -- The generalized Voronoi-algorithm in totally real algebraic number fields -- An algorithm for the computation of perfect polyhedral cones over real quadratic number fields -- Explicit determination of non-trivial torsion structures of elliptic curves over quadratic number fields -- p-Adic algorithms and the computation of zeros of p-adic l-functions -- On the solution of the diophantine equation Gn=pz -- Term orderings on the polynomial ring -- An algorithmic approach to local rings -- A reduction strategy for the taylor resolution -- From polynomials to Galois groups -- A system for parallel computer algebra programs -- Unification in parallel with refined linearity test: An example of recursive network structure in FP2, a functional parallel programming language -- The parallel L-machine for symbolic computation -- Unification in conditional-equational theories -- Mechanical translation of set theoretic problem specifications into efficient RAM code — A case study -- A methodology for automatic programming based on the constructive matching strategy -- The structural synthesis of programs: New means -- Taking advantage of symmetry in the automatic generation of numerical programs for finite element analysis -- Automatic generation of optimized programs -- Canonical form for rational exponential expressions -- Elementary and Liouvillian solutions of linear differential equations -- Analytical decoupling, decision of compatibility and partial integration of systems of nonlinear ordinary and partial differential equations -- Symbolic integration of exponential polynomials -- A REDUCE package for determining first integrals of autonomous systems of ordinary differential equations -- A package of tools for manipulation of sums and series -- Theory of summation in finite terms -- Abstract of the manuscript entitled "symbol manipulation and symmetry breaking" -- On improving approximate results of Buchberger's algorithm by Newton's method.
    Note: Literaturangaben
    Additional Edition: ISBN 3540159843
    Additional Edition: ISBN 0387159843
    Additional Edition: ISBN 9783540159841
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783540159841
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783662184400
    Language: English
    Keywords: Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Online Resource
    Online Resource
    Cham : Springer International Publishing AG
    UID:
    b3kat_BV049019479
    Format: 1 Online-Ressource (541 Seiten)
    Edition: 1st ed
    ISBN: 9783030928759
    Note: Description based on publisher supplied metadata and other sources , Intro -- Foreword -- References -- Preface -- References -- Contents -- Contributors -- Acronyms -- Introduction to Process Querying -- 1 Introduction -- 2 Process Querying -- 2.1 Objective -- 2.2 Definition -- 2.3 Methods -- 3 Process Querying Framework -- 3.1 Framework -- 3.2 Design Decisions -- 3.3 Challenges and Compromise -- 3.3.1 Challenges -- 3.3.2 Compromise -- 4 Conclusion -- References -- Part I Event Log Querying -- BP-SPARQL: A Query Language for Summarizing and Analyzing Big Process Data -- 1 Introduction -- 2 Background and Contributions Overview -- 3 Process Abstractions -- 4 Summarizing Big Process Data -- 5 Querying Big Process Data -- 5.1 Entity-Level Queries -- 5.2 Summarization Queries -- 5.3 Regular Expression Queries -- 5.3.1 Path Condition Queries -- 5.3.2 Path Node Queries -- 5.4 Metadata Queries -- 5.5 User-Defined Queries -- 6 Scalable Analysis Using MapReduce -- 7 Implementation -- 8 Process Querying Framework -- 9 Conclusion -- References -- Data-Aware Process Oriented Query Language -- 1 Introduction -- 2 Preliminaries -- 3 DAPOQ-Lang -- 3.1 Syntax -- 3.1.1 Terminal Meta Model Elements -- 3.1.2 Elements Related to Elements -- 3.1.3 Computation of Temporal Values -- 3.1.4 Temporal Interval Algebra -- 3.1.5 Operators on Attributes of Elements -- 3.1.6 Abstract Syntax -- 3.2 Semantics -- 4 Implementation and Evaluation -- 5 Application and Use Cases -- 5.1 Business Questions in Process Mining -- 5.2 Exporting Logs -- 5.3 Specialized Sublogs -- 5.4 Metrics, Artifacts, and Provenance -- 5.5 DAPOQ-Lang vs. SQL -- 6 DAPOQ-Lang and the Process Querying Framework -- 7 Conclusion -- References -- Process Instance Query Language and the Process Querying Framework -- 1 Introduction -- 2 Background -- 3 Motivating Scenario -- 4 Process Instance Query Language -- 4.1 Syntax -- 4.2 Semantics -- 4.3 Patterns and Predicates , 5 Implementation -- 6 Application -- 6.1 Dashboard Enriched with PIQL -- 6.2 DMN Enriched with PIQL -- 6.3 Dataflow Enriched with PIQL -- 7 Framework -- 8 Conclusions and Future Work -- References -- Part II Process Model Querying -- The Diagramed Model Query Language 2.0: Design, Implementation, and Evaluation -- 1 Introduction -- 2 Preliminaries -- 3 The Generic Model Query Language (GMQL) -- 3.1 Syntax -- 3.2 Semantics, Notation, and Query Example -- 3.3 The Transition from GMQL to DMQL -- 4 The Diagramed Model Query Language (DMQL) -- 4.1 Syntax -- 4.2 Notation -- 4.3 Semantics -- 4.4 Query Example -- 4.5 DMQL 2.0 -- 5 Evaluation -- 5.1 Runtime Complexity -- 5.2 Performance -- 5.3 Utility -- 6 GMQL, DMQL, and the Process Querying Framework -- 7 Conclusion -- References -- VM*: A Family of Visual Model Manipulation Languages -- 1 Introduction -- 2 Examples -- 2.1 High-Level Process Models Expressed as Use Case Diagrams -- 2.2 Low-Level Process Models Expressed as Activity Diagrams -- 2.3 Low-Level Process Models Expressed as BPMN Diagrams -- 3 Query Language -- 3.1 Abstract Syntax -- 3.2 Concrete Syntax -- 3.3 Semantics -- 4 Implementation -- 5 Usability Evaluation -- 6 Applications and Use Cases -- 7 VM* and PQF -- 8 Conclusion -- References -- The BPMN Visual Query Language and Process Querying Framework -- 1 Introduction -- 2 Background -- 3 BPMN VQL -- 3.1 Syntax -- 3.2 Semantics and Notation -- 4 Implementation and Evaluation -- 4.1 Implementation -- 4.2 Performance Evaluation -- 4.3 Empirical Evaluation -- 4.3.1 Experiment Definition, Planning, and Design -- 4.3.2 Experimental Results -- 4.3.3 Discussion -- 5 Framework -- 6 Conclusion and Future Work -- References -- Retrieving, Abstracting, and Changing Business Process Models with PQL -- 1 Introduction -- 2 Use Cases -- 3 Fundamentals of Process Model Abstractions -- 3.1 Process Model , 3.2 Changing Process Models -- 3.3 Process Model Abstractions -- 3.4 Updating Process Models Based on Model Abstractions -- 4 The PQL Language -- 4.1 Overview -- 4.2 Selecting Process Models and Process Elements -- 4.3 Changing Process Models -- 4.4 Abstracting Process Models -- 4.5 Handling Process Views with PQL -- 4.5.1 Creating, Updating, and Deleting Process Views -- 4.5.2 Changing Abstracted Process Models -- 5 Implementation -- 5.1 Software Architecture -- 5.2 Processing Pipeline -- 5.3 PQL Lexer and Parser -- 6 PQL and the Process Querying Framework -- 6.1 Part 1: Model, Simulate, Record, and Correlate -- 6.2 Part 2: Prepare -- 6.3 Part 3: Execute -- 6.4 Part 4: Interpret -- 7 Conclusion -- References -- QuBPAL: Querying Business Process Knowledge -- 1 Introduction -- 2 Business Process Knowledge Base -- 2.1 Business Process Schemas -- 2.2 Behavioral Semantics -- 2.3 Semantic Annotations -- 2.3.1 Rule-Based Ontologies -- 2.3.2 Terminological Annotations -- 2.3.3 Functional Annotations -- 3 Querying the Business Process Knowledge Base -- 3.1 Syntax -- Predicates of the WHERE Statement -- 3.2 Semantics -- 3.3 Query Examples -- 4 Use Cases -- 5 Implementation -- 5.1 Graphical User Interface -- 5.2 Application Logic -- 5.3 Knowledge Layer -- 6 Framework -- 7 Conclusions and Future Work -- References -- CRL and the Design-Time Compliance Management Framework -- 1 Introduction -- 2 CRL Framework -- 2.1 ''Model'' Part -- 2.2 ''Knowledge'' Part -- 2.3 ''Execute'' Part -- 2.4 ''Interpret'' Part -- 3 Case Study -- 4 Linear Temporal Logic -- 5 Compliance Request Language -- 5.1 Syntax, Notation, and Semantics -- 5.2 Atomic Patterns -- 5.3 Resource Patterns -- 5.4 Composite Patterns -- 5.5 Timed Patterns -- 6 Implementation -- 7 Validation and Evaluation -- 8 Discussion and Conclusion -- References -- Process Query Language -- 1 Introduction , 2 Motivating Examples -- 3 Process Query Language -- 3.1 Process Querying -- 3.1.1 Behavioral Predicates -- 3.1.2 Scenarios -- 3.2 Process Manipulation -- 4 Process Querying Framework -- 5 Implementation -- 6 Discussion -- 6.1 Querying and Manipulation -- 6.2 Quality -- 6.3 Suitability -- 6.4 Decidability and Efficiency -- 7 Conclusion -- References -- Part III Event Log and Process Model Querying -- Business Process Query Language -- 1 Introduction -- 2 Business Process Metamodel -- 3 Query Language -- 3.1 Syntax -- 3.2 Semantics -- 3.2.1 Architecture of the Query Evaluation Mechanism -- 3.2.2 Environment Stack -- 3.2.3 Query Result Stack -- 3.2.4 Query Evaluation Procedure -- 3.2.5 Collections and Structs -- 3.2.6 Literals and Names -- 3.2.7 Algebraic Operators -- 3.2.8 Non-algebraic Operators -- 3.2.9 Imperative Constructs -- 3.2.10 Procedures and Functions -- 3.2.11 Predefined Context-Dependent Functions -- 4 Monitoring Functions -- 4.1 Settlement of Travel Expenses Example -- 5 Architecture and Standardization -- 5.1 BPQL Embedded in BPMN -- 5.2 Architecture -- 6 Case Study -- 7 Conclusion -- References -- Celonis PQL: A Query Language for Process Mining -- 1 Introduction -- 2 Background -- 2.1 Process Mining -- 2.2 Architecture Overview -- 2.3 History of Celonis PQL -- 2.4 Design Goals -- 3 Applications -- 4 The Celonis Process Query Language -- 4.1 Language Overview -- 4.2 Source and Target Operators -- 4.3 Variant Computation -- 4.4 Conformance Checking -- 5 Use Cases -- 5.1 Working Capital Optimization by On-Time Payment of Invoices -- 5.2 Identifying Ping-Pong-Cases for Ticket Resolution Time Reduction -- 5.3 Fraud Prevention by Identifying Segregation of Duties Violations -- 6 Implementation -- 7 Celonis PQL and the Process Querying Framework -- 8 Conclusion and Future Work -- References -- Part IV Other Process Querying Methods , Process Querying Using Process Model Similarity -- 1 Introduction -- 2 Measures of Business Process Similarity -- 2.1 Preliminaries -- 2.2 Activity-Based Similarity Measures -- 2.3 Structure-Based Similarity Measures -- 2.4 Behavior-Based Similarity Measures -- 3 Indexing Structures for Business Process Similarity -- 3.1 Tree-Based Index and Proper Metrics -- 3.2 F-Net -- 4 Use Case: Finding Optimal Outsourcing Partners -- 4.1 Scenarios and Requirements for Business Process Outsourcing -- 4.2 Matching and Similarity Measures -- 4.3 Post-Matching -- 4.4 Similarity Measures in Business Process Outsourcing -- 5 Process Similarity Querying and the Process Querying Framework -- 6 Conclusion -- References -- Logic-Based Approaches for Process Querying -- 1 Introduction -- 2 Background -- 2.1 Business Process Model and Notation -- 2.2 The Soundness Property -- 3 Process Querying Using Prolog -- 3.1 Expressing the Model as Logic Facts -- 3.2 Checking Syntactical Correctness -- 3.3 Checking for Proper Layout -- 3.4 Locating Patterns Indicating a Soundness Violation -- 3.5 Locating Incorrect and Ambiguous Labels -- 3.6 Suggesting Process Model Refactoring -- 3.7 Suggesting Process Improvements -- 4 Process Querying Using Semantic Technologies -- 4.1 Querying Process Models Stored as Ontologies -- 4.2 Querying Process Models Stored in Graph-Oriented DB -- 5 Process Querying Framework -- 6 Conclusion -- References -- Process Model Similarity Techniques for Process Querying -- 1 Introduction -- 2 Foundations -- 2.1 Business Process Model -- 2.2 Business Process Instances -- 2.3 Business Process Model Matching -- 2.4 Business Process Model Similarity -- 2.5 Evaluation Measures -- 3 Process Model Querying and Similarity-Based Search -- 4 Selection of Similarity Techniques -- 4.1 Latent Semantic Analysis-Based Similarity Search , 4.2 Similarity Score Based on Common Activity Names
    Additional Edition: Erscheint auch als Druck-Ausgabe Polyvyanyy, Artem Process Querying Methods Cham : Springer International Publishing AG,c2022 ISBN 9783030928742
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Prozessanalyse ; Betriebliches Informationssystem ; Data Mining
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages