scientific article

No author found.

Publication date: 21 October 2009

Full work available at URL: http://www.sciencedirect.com/science/book/9780444522115

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Knowledge representation (68T30) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)

Related Items

On abstract modular inference systems and solvers, Combining event calculus and description logic reasoning via logic programming, Drawing interactive Euler diagrams from region connection calculus specifications, A Borda count for collective sentiment analysis, The HeKatE methodology. Hybrid engineering of intelligent systems, Careful synchronization of partial deterministic finite automata, Drawing Euler Diagrams from Region Connection Calculus Specifications with Local Search, Infinitary equilibrium logic and strongly equivalent logic programs, Belief revision within fragments of propositional logic, On First-Order Model-Based Reasoning, Machine learning and logic: a new frontier in artificial intelligence, Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs, Proving infinitary formulas, Range-based argumentation semantics as two-valued models, Belief revision and computational argumentation: a critical comparison, ASP and subset minimality: enumeration, cautious reasoning and MUSes, Pattern-based and composition-driven automatic generation of logical specifications for workflow-oriented software models, Better Paracoherent Answer Sets with Less Resources, Non existence of some mixed Moore graphs of diameter 2 using SAT, Semi-supervised online structure learning for composite event recognition, Relevance in belief revision, SAT backdoors: depth beats size, An Epistemological Study of Theory Change, Parallel belief revision: revising by sets of formulas, Recognizing textual entailment and computational semantics, Reasoning about actions with loops via Hoare logic, Logics for extended distributive contact lattices, Local search with edge weighting and configuration checking heuristics for minimum vertex cover, Guarantees and limits of preprocessing in constraint satisfaction and reasoning, Finding explanations of inconsistency in multi-context systems, A general first-order solution to the ramification problem with cycles, Probability and time, A weighted causal theory for acquiring and utilizing open knowledge, Resolution proof transformation for compression and interpolation, Proof Verification Technology and Elementary Physics, On the tractability of minimal model computation for some CNF theories, DPLL: The Core of Modern Satisfiability Solvers, Some thoughts on knowledge-enhanced machine learning, Paracoherent answer set computation, Modeling time and valuation in structured argumentation frameworks, Qualitative case-based reasoning and learning, Guest editors' introduction, Rational evaluation in belief revision, From description-logic programs to multi-context systems, The packing while traveling problem, Recursive definitions of tabular transformations, Automated verification of state sequence invariants in general game playing, Conflict-driven answer set solving: from theory to practice, John McCarthy's legacy, Formalising the Fisherman's Folly puzzle, SAT and IP based algorithms for magic labeling including a complete search for total magic labelings, Stochastic optimization with adaptive restart: a framework for integrated local and global learning, Revising event calculus theories to recover from unexpected observations, New models for generating hard random Boolean formulas and disjunctive logic programs, Belief revision in Horn theories, Determining inference semantics for disjunctive logic programs, plasp 3: Towards Effective ASP Planning, Evolution of Region Connection Calculus to VRCC-3D+, Transforming gringo rules into formulas in a natural way, The aspect calculus, Rule-Based Reasoning with Belief Structures, On the relationship between the complexity of decidability and decomposability of first-order theories, A Propositional CONEstrip Algorithm, A parallel memory-efficient epistemic logic program solver: harder, better, faster, Belief base contraction by belief accrual, A Dynamic Neural Field Approach to Natural and Efficient Human-Robot Collaboration, New records of pre-image search of reduced SHA-1 using SAT solvers, Vivid: a framework for heterogeneous problem solving, A paraconsistent approach to actions in informationally complex environments, An enhanced logical benders approach for linear programs with complementarity constraints, A Panorama of Iterated Revision, Possible models computation and revision -- a practical approach, Set of support, demodulation, paramodulation: a historical perspective, Implementing Efficient All Solutions SAT Solvers