32 found
Order:
  1.  13
    Theory of Deductive Systems and its Applications.S. Iu Maslov, Michael Gelfond & Vladimir Lifschitz - 1987
    Direct download  
     
    Export citation  
     
    My bibliography   28 citations  
  2.  2
    The Stable Model Semantics for Logic Programming.Michael Gelfond, Vladimir Lifschitz, Robert A. Kowalski, Kenneth A. Bowen, Kit Fine & Jens Erik Fenstad - 1992 - Journal of Symbolic Logic 57 (1):274-277.
    Direct download  
     
    Export citation  
     
    My bibliography   17 citations  
  3. 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  
     
    My bibliography   2 citations  
  4.  3
    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  
     
    My bibliography   1 citation  
  5.  34
    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  
     
    My bibliography  
  6.  22
    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  
     
    My bibliography  
  7.  33
    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  
     
    My bibliography  
  8.  13
    Constructive Assertions in an Extension of Classical Mathematics.Vladimir Lifschitz - 1982 - Journal of Symbolic Logic 47 (2):359-387.
  9.  32
    Knowledge Representation and Classical Logic.Vladimir Lifschitz, L. Morgenstern & D. Plaisted - manuscript
    in Handbook of Knowledge representation, Elsevier, 2008.
    Direct download  
     
    Export citation  
     
    My bibliography  
  10.  7
    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.
  11.  12
    Functional Completion.Vladimir Lifschitz & Fangkai Yang - 2013 - Journal of Applied Non-Classical Logics 23 (1-2):121-130.
  12.  18
    Nonmonotonic Causal Theories.Joohyung Lee, Vladimir Lifschitz & Hudson Turner - unknown
    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  
    Translate
     
     
    Export citation  
     
    My bibliography  
  13.  17
    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  
     
    My bibliography  
  14.  6
    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 (4 more)  
     
    Export citation  
     
    My bibliography  
  15.  14
    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  
     
    My bibliography  
  16.  13
    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  
     
    My bibliography  
  17.  5
    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  
     
    My bibliography  
  18.  6
    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  
     
    My bibliography  
  19.  4
    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  
     
    My bibliography  
  20.  6
    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  
     
    My bibliography  
  21.  4
    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  
     
    My bibliography  
  22.  4
    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  
     
    My bibliography  
  23.  4
    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  
     
    My bibliography  
  24.  2
    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  
     
    My bibliography  
  25.  1
    In memoriam: Grigori E. Mints 1939–2014.Solomon Feferman & Vladimir Lifschitz - 2015 - Bulletin of Symbolic Logic 21 (1):31-33.
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    My bibliography  
  26.  3
    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  
     
    My bibliography  
  27.  1
    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  
     
    My bibliography  
  28.  2
    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  
     
    My bibliography  
  29.  1
    Review: Alan Bundy, The Computer Modelling of Mathematical Reasoning. [REVIEW]Vladimir Lifschitz - 1987 - Journal of Symbolic Logic 52 (2):555-557.
  30. Logic Programming 20th International Conference, Iclp 2004, Saint-Malo, France, September 6-10, 2004 : Proceedings.Bart Demoen & Vladimir Lifschitz - 2004
     
    Export citation  
     
    My bibliography  
  31. Bundy Alan. 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.
  32. Logic Programming and Nonmonotonic Reasoning 7th International Conference, Lpnmr 2004, Fort Lauderdale, Fla., January 6-8, 2004 : Proceedings. [REVIEW]Vladimir Lifschitz & Ilkka Niemelä - 2004
     
    Export citation  
     
    My bibliography