Lifschitz Vladimir (58 results)

Hardcover. Condition: Very Good. Sorry, No international shipping on this item.Ex-Library hardcover in very nice condition with the usual markings and attachments. Except for library markings, interior clean and unmarked. Tight binding.

Hardcover. Condition: Very Good. Book has a slightly loose first signature, light rubbing to covers, mild wear to edges and corners, light smudges between front endpaper/endpage, light smudges to bottom of spine. otherwise in great condition, strong binding, bright and unmarked pages; some light signs of aging but an overall sturdy copy with clean interiors.…

2004. 15 x 23 cm. XII, 484 S. XII, 484 p. Hardcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. (Lecture Notes in Computer Science). Sprache: Englisch.…

Condition: very_good. Fast Free Shipping â" Very Good condition book with a firm cover and clean pages. Shows normal use and some light wear or limited notes markings. A solid, nice copy to enjoy.

Hardcover. Condition: new. Hardcover. Answer set programming (ASP) is a programming methodology oriented towards combinatorial search problems. In such a problem, the goal is to find a solution among a large but finite number of possibilities. The idea of ASP came from research on artificial intelligence and computational logic. ASP is a form of declarative programming: an ASP program describes what is counted as a solution to the problem, but does not specify an algorithm for solving it. Search is performed by sophisticated software systems called answer set solvers.Combinatorial search problems often arise in science and technology, and ASP has found applications in diverse areasin historical linguistic, in bioinformatics, in robotics, in space exploration, in oil and gas industry, and many others. The importance of this programming method was recognized by the Association for the Advancement of Artificial Intelligence in 2016, when AI Magazine published a special issue on answer set programming.The book introduces the reader to the theory and practice of ASP. It describes the input language of the answer set solver CLINGO, which was designed at the University of Potsdam in Germany and is used today by ASP programmers in many countries. It includes numerous examples of ASP programs and present the mathematical theory that ASP is based on. There are many exercises with complete solutions. Answer set programming (ASP) is a programming methodology oriented towards combinatorial search problems. ASP is a form of declarative programming: an ASP program describes what is counted as a solution to the problem, but does not specify an algorithm for solving it. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New.

Paperback. Condition: Brand New. 1st edition. 365 pages. 9.25x6.00x0.75 inches. In Stock.

Condition: New. pp. XI, 190 53 illus. 1st ed. 2019 edition NO-PA16APR2015-KAP.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Invited Talks.- Termination by Abstraction.- Answer Set Programming and the Design of Deliberative Agents.- Regular Talks.- Abstract Domains Based on Regular Types.- Termination of Logic Programs Using Various Dynamic Selection Rules.- Improving Prolog Programs: Refactoring for Prolog.- Smodels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP.- The Refined Operational Semantics of Constraint Handling Rules.- Compiling Ask Constraints.- Constraint Handling Rules and Tabled Execution.- Possible Worlds Semantics for Probabilistic Logic Programs.- Limiting Resolution: From Foundations to Implementation.- Generalised Kernel Sets for Inverse Entailment.- On Programs with Linearly Ordered Multiple Preferences.- Splitting an Operator.- Simplifying Logic Programs Under Answer Set Semantics.- On Acyclic and Head-Cycle Free Nested Logic Programs.- Fast Query Evaluation with (Lazy) Control Flow Compilation.- Speculative Computations in Or-Parallel Tabled Logic Programs.- Prolog: A Logic Programming Language with Names, Binding and -Equivalence.- Implementation Results in Classical Constructive Negation.- On Hybridization of Local Search and Constraint Propagation.- Arc-Consistency + Unit Propagation = Lookahead.- The period Constraint.- Non-viability Deductions in Arc-Consistency Computation.- Compiling Prioritized Circumscription into Answer Set Programming.- Enhancing the Magic-Set Method for Disjunctive Datalog Programs.- Rectilinear Steiner Tree Construction Using Answer Set Programming.- Adding Domain Dependent Knowledge into Answer Set Programs for Planning.- Multi-agent Coordination as Distributed Logic Programming.- Logic Programs with Annotated Disjunctions.- Poster Presentations.- Abstract Interpretation-Based Mobile CodeCertification.- Labeled Logic Programs.- Xcerpt and XChange - Logic Programming Languages for Querying and Evolution on the Web.- Protein Folding Simulation in CCP.- Applying CLP to Predict Extra-Functional Properties of Component-Based Models.- Main Results of the OADymPPaC Project.- FDBG, the CLP Debugger Library of SICStus Prolog.- Development of Semantic Debuggers Based on Refinement Calculus.- A Tracer Driver to Enable Debugging, Monitoring and Visualization of CLP Executions from a Single Tracer.- Grid Service Selection with PPDL.- Concurrent Constraint Programming and Tree-Based Acoustic Modelling.- MProlog: An Extension of Prolog for Modal Logic Programming.- Probabilistic Choice Operators as Global Constraints: Application to Statistical Software Testing.- Constraint-Based Synchronization and Verification of Distributed Java Programs.- JmmSolve: A Generative Java Memory Model Implemented in Prolog and CHR.- Agent Oriented Logic Programming Constructs in Jinni 2004.…

Condition: New. pp. 190.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Invited Papers.- Constraints and Probabilistic Networks: A Look At The Interface.- Toward A Universal Inference Engine.- Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative.- Regular Papers.- Semantics for Dynamic Logic Programming: A Principle-Based Approach.- Probabilistic Reasoning With Answer Sets.- Answer Sets: From Constraint Programming Towards Qualitative Optimization.- A Logic of Non-monotone Inductive Definitions and Its Modularity Properties.- Reasoning About Actions and Change in Answer Set Programming.- Almost Definite Causal Theories.- Simplifying Logic Programs Under Uniform and Strong Equivalence.- Towards Automated Integration of Guess and Check Programs in Answer Set Programming.- Towards Automated Integration of Guess and Check Programs in Answer Set Programming.- Graphs and Colorings for Answer Set Programming: Abridged Report.- Nondefinite vs. Definite Causal Theories.- Logic Programs With Monotone Cardinality Atoms.- Set Constraints in Logic Programming.- Verifying the Equivalence of Logic Programs in the Disjunctive Case.- Uniform Equivalence for Equilibrium Logic and Logic Programs.- Partial Stable Models for Logic Programs with Aggregates.- Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs.- Using Criticalities as a Heuristic for Answer Set Programming.- Planning with Preferences Using Logic Programming.- Planning with Sensing Actions and Incomplete Information Using Logic Programming.- Deduction in Ontologies via ASP.- Strong Equivalence for Causal Theories.- Answer Set Programming with Clause Learning.- Properties of Iterated Multiple Belief Revision.- System Descriptions.- System Description: DLV with Aggregates.- GNT - A Solver for Disjunctive Logic Programs.-LPEQ and DLPEQ - Translators for Automated Equivalence Testing of Logic Programs.- DLV DB : Bridging the Gap between ASP Systems and DBMSs.- Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs.- WSAT(CC) - A Fast Local-Search ASP Solver.- Smodels with CLP-A Treatment of Aggregates in ASP.- nlp: A Compiler for Nested Logic Programming.…

Paperback. Condition: Brand New. 490 pages. 9.00x6.00x1.11 inches. In Stock.

Hardcover. Condition: Brand New. 190 pages. 9.50x6.25x0.75 inches. In Stock.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Answer set programming (ASP) is a programming methodology oriented towards combinatorial search problems. In such a problem, the goal is to find a solution among a large but finite number of possibilities. The idea of ASP came from research on artificial intelligence and computational logic. ASP is a form of declarative programming: an ASP program describes what is counted as a solution to the problem, but does not specify an algorithm for solving it. Search is performed by sophisticated software systems called answer set solvers.Combinatorial search problems often arise in science and technology, and ASP has found applications in diverse areas-in historical linguistic, in bioinformatics, in robotics, in space exploration, in oil and gas industry, and many others. The importance of this programming method was recognized by the Association for the Advancement of Artificial Intelligence in 2016, when AI Magazine published a special issue on answer set programming.The book introduces the reader to the theory and practice of ASP. It describes the input language of the answer set solver CLINGO, which was designed at the University of Potsdam in Germany and is used today by ASP programmers in many countries. It includes numerous examples of ASP programs and present the mathematical theory that ASP is based on. There are many exercises with complete solutions.…

Condition: good. The book is in good condition with all pages and cover intact, including the dust jacket if originally issued. The spine may show light wear. Pages may contain some notes or highlighting, and there might be a "From the library of" label. Boxed set packaging, shrink wrap, or included media like CDs may be missing.…

Condition: New.

Hardcover. Condition: Good. 1st Edition. Clean pages, sound binding. Hardcover boards show some light wear and denting along edges.

Hardcover. Condition: new. Hardcover. Answer set programming (ASP) is a programming methodology oriented towards combinatorial search problems. In such a problem, the goal is to find a solution among a large but finite number of possibilities. The idea of ASP came from research on artificial intelligence and computational logic. ASP is a form of declarative programming: an ASP program describes what is counted as a solution to the problem, but does not specify an algorithm for solving it. Search is performed by sophisticated software systems called answer set solvers.Combinatorial search problems often arise in science and technology, and ASP has found applications in diverse areasin historical linguistic, in bioinformatics, in robotics, in space exploration, in oil and gas industry, and many others. The importance of this programming method was recognized by the Association for the Advancement of Artificial Intelligence in 2016, when AI Magazine published a special issue on answer set programming.The book introduces the reader to the theory and practice of ASP. It describes the input language of the answer set solver CLINGO, which was designed at the University of Potsdam in Germany and is used today by ASP programmers in many countries. It includes numerous examples of ASP programs and present the mathematical theory that ASP is based on. There are many exercises with complete solutions. Answer set programming (ASP) is a programming methodology oriented towards combinatorial search problems. ASP is a form of declarative programming: an ASP program describes what is counted as a solution to the problem, but does not specify an algorithm for solving it. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New.