45 found
Order:
  1.  18
    Theory of Deductive Systems and its Applications.S. Iu Maslov, Michael Gelfond & Vladimir Lifschitz - 1987
  2.  13
    Theory of Deductive Systems and its Applications.Daniel J. Dougherty, S. Yu Maslov, Michael Gelfond & Vladimir Lifschitz - 1988 - Journal of Symbolic Logic 53 (4):1260.
  3.  21
    Nonmonotonic Causal Theories.Joohyung Lee, Vladimir Lifschitz & Hudson Turner - 2004 - Artificial Intelligence 153 (1-2):49-104.
    cuted actions. It has been applied to several challenge problems in the theory of commonsense knowledge. We study the relationship between this formalism and other work on nonmonotonic reasoning and knowl-.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  4. What is Answer Set Programming?Vladimir Lifschitz - unknown
    Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in knowledge representation, it is particularly useful in knowledge-intensive applications. ASP programs consist of rules that look like Prolog rules, but the computational mechanisms used in ASP are different: they are based on the ideas that have led to the creation of fast satisfiability solvers for propositional logic.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  5.  7
    A Modular Action Description Language.Vladimir Lifschitz - unknown
    “Toy worlds” involving actions, such as the blocks world and the Missionaries and Cannibals puzzle, are often used by researchers in the areas of commonsense reasoning and planning to illustrate and test their ideas. We would like to create a database of generalpurpose knowledge about actions that encodes common features of many action domains of this kind, in the same way as abstract algebra and topology represent common features of specific number systems. This paper is a report on the first (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   5 citations  
  6.  30
    The Dramatic True Story of the Frame Default.Vladimir Lifschitz - 2015 - Journal of Philosophical Logic 44 (2):163-176.
    This is an expository article about the solution to the frame problem proposed in 1980 by Raymond Reiter. For years, his “frame default” remained untested and suspect. But developments in some seemingly unrelated areas of computer science—logic programming and satisfiability solvers—eventually exonerated the frame default and turned it into a basis for important applications.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  1
    Representing Action: Indeterminacy and Ramifications.Enrico Giunchiglia, G. Neelakantan Kartha & Vladimir Lifschitz - 1997 - Artificial Intelligence 95 (2):409-438.
  8.  1
    Representing the Zoo World and the Traffic World in the Language of the Causal Calculator.Varol Akman, Selim T. Erdoğan, Joohyung Lee, Vladimir Lifschitz & Hudson Turner - 2004 - Artificial Intelligence 153 (1-2):105-140.
  9.  22
    Functional Completion.Vladimir Lifschitz & Fangkai Yang - 2013 - Journal of Applied Non-Classical Logics 23 (1-2):121-130.
    Nonmonotonic causal logic is a knowledge representation language designed for describing domains that involve actions and change. The process of literal completion, similar to program completion familiar from the theory of logic programming, can be used to translate some nonmonotonic causal theories into classical logic. Its applicability is restricted, however, to theories that deal with truth-valued fluents, represented by predicate symbols. In this note we introduce functional completion—a more general process that can be applied to causal theories in which fluents (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  44
    Knowledge Representation and Classical Logic.Vladimir Lifschitz, L. Morgenstern & D. Plaisted - manuscript
    in Handbook of Knowledge representation, Elsevier, 2008.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  15
    Constructive Assertions in an Extension of Classical Mathematics.Vladimir Lifschitz - 1982 - Journal of Symbolic Logic 47 (2):359-387.
  12.  23
    The Semantics of Variables in Action Descriptions.Vladimir Lifschitz & W. Ren - manuscript
    structures, or interpretations, in the sense of first-order logic. In C+, on the other hand, a state is an interpreta-.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  13.  21
    Twelve Definitions of a Stable Model.Vladimir Lifschitz - unknown
    This is a review of some of the definitions of the concept of a stable model that have been proposed in the literature. These definitions are equivalent to each other, at least when applied to traditional Prologstyle programs, but there are reasons why each of them is valuable and interesting. A new characterization of stable models can suggest an alternative picture of the intuitive meaning of logic programs; or it can lead to new algorithms for generating stable models; or it (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  14.  7
    Mathematical Foundations of Answer Set Programming.Vladimir Lifschitz - unknown
    applied, for instance, to developing a decision support system for the Space Shuttle INogueira et al., 2001] and to graph-theoretic problems arising in..
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  15.  9
    Actions as Special Cases.Vladimir Lifschitz - unknown
    This paper is motivated by the idea of interaction between two directions of research in knowledge representation: the design of action description languages and the development of libraries of reusable, general-purpose knowledge components. Writing an action description that characterizes actions in terms of their effects, as common today, can be compared to writing a program that does not use standard subroutines. We conjecture that a library of standard descriptions for a number of “basic” actions can facilitate writing, understanding and modifying (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  16.  9
    On Calculational Proofs.Vladimir Lifschitz - 2001 - Annals of Pure and Applied Logic 113 (1-3):207-224.
    This note is about the “calculational style” of presenting proofs introduced by Dijkstra and Scholten and adopted in some books on theoretical computer science. We define the concept of a calculation, which is a formal counterpart of the idea of a calculational proof. The definition is in terms of a new formalization DS of predicate logic. Any proof tree in the system DS can be represented as a sequence of calculations. This fact shows that any logically valid predicate formula has (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  17. Logic Programming 20th International Conference, Iclp 2004, Saint-Malo, France, September 6-10, 2004 : Proceedings.Bart Demoen & Vladimir Lifschitz - 2004 - Springer Verlag.
    This book constitutes the refereed proceedings of the 20th International Conference on Logic Programming, ICLP 2004, held in Saint-Malo, France in September 2004. The 28 revised full papers and 16 poster papers presented together with 2 invited papers were carefully reviewed and selected from 70 submissions. The papers are organized in topical sections on program analysis, constraints, alternative programming paradigms, answer set programming, and implementation.
    Direct download  
     
    Export citation  
     
    Bookmark  
  18.  4
    In memoriam: Grigori E. Mints 1939–2014.Solomon Feferman & Vladimir Lifschitz - 2015 - Bulletin of Symbolic Logic 21 (1):31-33.
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  19. Stable Models and Circumscription.Paolo Ferraris, Joohyung Lee & Vladimir Lifschitz - 2011 - Artificial Intelligence 175 (1):236-263.
  20. Infinitary Equilibrium Logic and Strongly Equivalent Logic Programs.Amelia Harrison, Vladimir Lifschitz, David Pearce & Agustín Valverde - 2017 - Artificial Intelligence 246:22-33.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  21.  9
    A Knowledge Module: Buying and Selling.Joohyung Lee & Vladimir Lifschitz - unknown
    This note shows how to formalize a small set of general facts about buying and selling. We begin with summarizing properties of buying/selling informally in English, and give examples of consequences of these assumptions. Then we formalize our assumptions in action language C+ with additive fluents and actions and test the adequacy of the proposed formalization using the Causal Calculator.
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  22.  40
    Safe Formulas in the General Theory of Stable Models (Preliminary Report).Joohyung Lee & Vladimir Lifschitz - unknown
    Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of its grounding—to the variable-free sentence obtained from it by replacing all quantifiers with multiple conjunctions and disjunctions. It follows that a safe sentence and the result of its grounding have the same stable models, and that stable models of a safe sentence can (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  23.  14
    Alan Bundy. The Computer Modelling of Mathematical Reasoning. Academic Press, London Etc. 1983, Xiv + 322 Pp. [REVIEW]Vladimir Lifschitz - 1987 - Journal of Symbolic Logic 52 (2):555-557.
  24.  6
    Almost Definite Causal Theories.Vladimir Lifschitz - unknown
    The language of nonmonotonic causal theories, defined by Norman McCain and Hudson Turner, is an important formalism for representing properties of actions. For causal theories of a special kind, called definite, a simple translation into the language of logic programs under the answer set semantics is available. In this paper we define a similar translation for causal theories of a more general form, called al-.
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  25.  18
    A Reductive Semantics for Counting and Choice in Answer Set Programming.Vladimir Lifschitz - unknown
    In a recent paper, Ferraris, Lee and Lifschitz conjectured that the concept of a stable model of a first-order formula can be used to treat some answer set programming expressions as abbreviations. We follow up on that suggestion and introduce an answer set programming language that defines the mean- ing of counting and choice by reducing these constructs to first-order formulas. For the new language, the concept of a safe program is defined, and its semantic role is investigated. We compare (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  26. Answer Set Programming and Plan Generation.Vladimir Lifschitz - 2002 - Artificial Intelligence 138 (1-2):39-54.
  27. Closed-World Databases and Circumscription.Vladimir Lifschitz - 1985 - Artificial Intelligence 27 (2):229-235.
  28.  6
    Definitions in Answer Set Programming.Vladimir Lifschitz - unknown
    affects the collection of answer sets. In particular, it is useful to be able to describe the effects of adding definitions to a program with nested expressions, in view of the relation of this class of programs to the input language of the answer set programming system sMonELs. In this..
    No categories
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  29. Frames in the Space of Situations.Vladimir Lifschitz - 1990 - Artificial Intelligence 46 (3):365-376.
  30.  6
    Irrelevant Actions in Plan Generation.Vladimir Lifschitz - unknown
    be irrelevant for achieving the given goal. We make this idea precise by defining, for an action description in language C+, when a subset of its..
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  31. Logic Programming and Nonmonotonic Reasoning 7th International Conference, Lpnmr 2004, Fort Lauderdale, Fla., January 6-8, 2004 : Proceedings. [REVIEW]Vladimir Lifschitz & Ilkka Niemelä - 2004 - Springer Verlag.
    This book constitutes the refereed proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2004, held in Fort Lauderdale, Florida, USA in January 2004. The 24 revised full papers presented together with 8 system descriptions were carefully reviewed and selected for presentation. Among the topics addressed are declarative logic programming, nonmonotonic reasoning, knowledge representation, combinatorial search, answer set programming, constraint programming, deduction in ontologies, and planning.
    Direct download  
     
    Export citation  
     
    Bookmark  
  32. Minimal Belief and Negation as Failure.Vladimir Lifschitz - 1994 - Artificial Intelligence 70 (1-2):53-72.
  33. Miracles in Formal Theories of Action.Vladimir Lifschitz & Arkady Rabinov - 1989 - Artificial Intelligence 38 (2):225-237.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  34.  1
    M. Shanahan, Solving the Frame Problem☆☆MIT Press, Cambridge, MA, 1997. 410 Pp. $55.00 (Cloth). ISBN 0-262-19384-1. Http://Mitpress.MIT.Edu/Book-Home.Tcl?Isbn = 0262193841. [REVIEW]Vladimir Lifschitz - 2000 - Artificial Intelligence 123 (1-2):265-268.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  35. Nested Abnormality Theories.Vladimir Lifschitz - 1995 - Artificial Intelligence 74 (2):351-365.
  36. On the Logic of Causal Explanation.Vladimir Lifschitz - 1997 - Artificial Intelligence 96 (2):451-465.
  37. On the Satisfiability of Circumscription.Vladimir Lifschitz - 1986 - Artificial Intelligence 28 (1):17-27.
  38.  9
    Papers Published Between 1996 and 2000.Vladimir Lifschitz - manuscript
    (Click here for selected papers published before 1996, and here for papers published after 2000.) V. Lifschitz, Foundations of logic programming ," in Principles of Knowledge Representation , CSLI Publications, 1996, pp. 69-127. E. Giunchiglia, N. Kartha and V. Lifschitz, Representing action: indeterminacy and ramifications ," Artificial Intelligence , Vol. 95, 1997, pp. 409-443. V. Lifschitz, On the logic of causal explanation ," Artificial Intelligence , Vol. 96, 1997, pp. 451-465. V. Lifschitz, Two components of an action language ," Annals (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  39.  3
    Review: Alan Bundy, The Computer Modelling of Mathematical Reasoning. [REVIEW]Vladimir Lifschitz - 1987 - Journal of Symbolic Logic 52 (2):555-557.
  40.  61
    Safe Formulas in the General Theory of Stable Models (Preliminary Report).Vladimir Lifschitz - unknown
    Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of its grounding—to the variable-free sentence obtained from it by replacing all quantifiers with multiple conjunctions and disjunctions. It follows that a safe sentence and the result of its grounding have the same stable models, and that stable models of a safe sentence can (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  41.  5
    Selected Papers Published Before 1996.Vladimir Lifschitz - manuscript
    (Click here for the papers published between 1996 and 2000, and here for more recent papers.) V. Lifschitz, On the semantics of STRIPS ," in: Reasoning about Actions and Plans , 1987, pp. 1-9. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming ," in Logic Programming: Proceedings of the Fifth International Conference and Symposium , 1988, pp. 1070-1080.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  42.  12
    Temporal Phylogenetic Networks and Logic Programming.Vladimir Lifschitz - unknown
    The concept of a temporal phylogenetic network is a mathematical model of evolution of a family of natural languages. It takes into account the fact that languages can trade their characteristics with each other when linguistic communities are in contact, and also that a contact is only possible when the languages are spoken at the same time. We show how computational methods of answer set programming and constraint logic programming can be used to generate plausible conjectures about contacts between prehistoric (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  43.  6
    Variables in Action Descriptions: Merging C+ with ADL.Vladimir Lifschitz - unknown
    Action description language C+ is more expressive than ADL in many ways; for instance, it addresses the ramification problem. On the other hand, ADL is based on first-order logic, while C+ is only propositional; expressions with variables, which are frequently used when action domains are described in C+, are merely..
    No categories
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  44.  6
    Why the Monkey Needs the Box: A Serious Look at a Toy Domain.Vladimir Lifschitz - unknown
    “Toy worlds” involving actions, such as the Blocks World and the Monkey and Bananas domain, are often used by researchers in the areas of commonsense reasoning and planning to illustrate and test their ideas. Many of the axioms found in descriptions of these toy worlds are expressions of generalpurpose knowledge, though they are often cast in a form only useful for solving one specific problem and are not faithful representations of general facts that can be used in other domains. Instead (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  45.  1
    Handbook of Knowledge Representation.Frank Van Harmelen, Vladimir Lifschitz & Bruce Porter - 2008 - Elsevier.
    Knowledge representation, which lies at the core of artificial intelligence, is concerned with encoding knowledge on computers to enable systems to reason automatically. The aims are to help readers make their computer smarter, handle qualitative and uncertain information, and improve computational tractability.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark