Мобильная версия

Доступно журналов:

2 361

Доступно статей:

3 493 662

 

Oxford University Press по журналам "Journal of Logic and Computation"

Отсортировать по: Порядок: Результаты:

  • MASINI ANDREA (Oxford University Press, 1993-10-01)
    In this work we propose a study of intuitionistic minimal modal logics by means of a new calculus called intuitionistic 2-sequent calculus. We show that the proposed calculus has an associated natural deduction system. We ...
  • KAKAS A. C.; KOWALSKI R. A.; TONI F. (Oxford University Press, 1992-12-01)
    This paper is a survey and critical overview of recent work on the extension of logic programming to perform abductive reasoning (abductive logic programming). We outline the general framework of abduction and its applications ...
  • GUESSARIAN IRÈNE; VELOSO-PEIXOTO MARCOS (Oxford University Press, 1994-08-01)
    We prove that boundedness is decidable for uniformly connected Datalog programs. We study various semantics (cumulative, non-deterministic, well-founded and stratified) for Datalogneg programs. We compare the various ...
  • COUSOT PATRICK; COUSOT RADHIA (Oxford University Press, 1992-08-01)
    We introduce abstract interpretation frameworks which are variations on the archetypal framework using Galois connections between concrete and abstract semantics, widenings and narrowings and are obtained by relaxation of ...
  • ABRAMSKY SAMSON (Oxford University Press, 1990-07-01)
    We develop a formalism for abstract interpretation based on logical relations. As a case study, we use this formalism to give new proofs of correctness for strictness analysis on the typed λ-calculus, and also for termination ...
  • Неизвестный автор (Oxford University Press, 1994-12-01)
  • Неизвестный автор (Oxford University Press, 1992-12-01)
  • Неизвестный автор (Oxford University Press, 1991-12-01)
  • Неизвестный автор (Oxford University Press, 1995-12-01)
  • Неизвестный автор (Oxford University Press, 1993-12-01)
  • WILKINS DAVID E.; MYERS KAREN L. (Oxford University Press, 1995-12-01)
    The ability to integrate sophisticated planning techniques with reactive execution systems is critical for non-trivial applications. Merging these two technologies is difficult because the forms of knowledge and reasoning ...
  • STÄRK ROBERT F. (Oxford University Press, 1991-12-01)
    We prove the completeness of extended SLDNF-resolution for the new class of e-programs with respect to the three-valued completion of a logic program. Not only the class of allowed programs but also the class of definite ...
  • DOWEK GILLES (Oxford University Press, 1993-06-01)
    We present a complete proof synthesis method for the eight type systems of Barendregt's cube extended with η-conversion. Because these systems verify the proofs-as-objects paradigm, the proof synthesis method is a one-level ...
  • BENEVIDES MARIO R. F.; MAIBAUM THOMAS S. E. (Oxford University Press, 1992-03-01)
    This work provides a constructive presentation of modal logis in natural deduction style. The modal connective □ is presented in a constructive form, which can be considered as an operational semantics for it. Modal ...
  • ALLEN JAMES F.; FERGUSON GEORGE (Oxford University Press, 1994-10-01)
    We present a representation of events and action based on interval temporal logic that is significantly more expressive and more natural than most previous AI approaches. The representation is motivated by work in natural ...
  • STEEL SAM (Oxford University Press, 1994-10-01)
    If one executes a plan, one will need to ‘know whether’ facts tested in it are true, and to ‘know how’ to execute primitive actions in it. It is possible to axiomatize what one needs to know for a plan to be satisfactory. ...
  • COMPTON K. (Oxford University Press, 1993-04-01)
    Existential least fixpoint logic (ELFP) is a logic with a least fixpoint operator but only existential quantification. It arises in many areas of computer science including logic programming, database theory, program ...
  • PEDNAULT EDWIN P. D. (Oxford University Press, 1994-10-01)
    This paper provides a complete presentation of the syntax, semantics, and some of the properties of ADL, a formalism for representing and reasoning about the effects of actions. ADL is based on the state-transition model ...
  • CAYROL MICHEL; PALMADE OLIVIER; SCHIEX THOMAS (Oxford University Press, 1993-04-01)
    The ATMS resolution mechanisms have been formalized, using the concept of DK-tree. We propose in this paper a new and simple approach based on the fixed point theory and an original demonstration of the completeness of ...
  • LAENENS E.; VERMEIR D. (Oxford University Press, 1990-12-01)
    We develop semantics for a logic, called ordered logic (OL), which models the most important aspects of object-oriented programming languages, such as object identity, multiple inheritance and defaults. The logic is based ...