Browsing by Subject "Logic programming"

Now showing items 21-40 of 50

    • Article  

      Default reasoning via negation as failure 

      Kakas, Antonis C. (1994)
      We show how recent developments in the study of negation as failure of Logic Programming can be used to define a general framework for Default Reasoning. Negation as failure can be viewed as a form of hypotheses with which ...
    • Article  

      Encoding planning problems in nonmonotonic logic programs 

      Dimopoulos, Yannis; Nebel, B.; Koehler, J. (1997)
      We present a framework for encoding planning problems in logic programs with negation as failure, having computational efficiency as our major consideration. In order to accomplish our goal, we bring together ideas from ...
    • Conference Object  

      Essential features of a compiler target language for parallel machines 

      Papadopoulos, George Angelos (IEEE, 1995)
      Term Graph Rewriting Systems (TGRS) have been used extensively as an implementation vehicle for a number of, often divergent, programming paradigms ranging from the traditional functional programming ones to the (concurrent) ...
    • Article  

      Extended semantics and optimization algorithms for CP-networks 

      Brafman, R. I.; Dimopoulos, Yannis (2004)
      Preference elicitation is a serious bottleneck in many decision support applications and agent specification tasks. Ceteris paribus (CP)-nets were designed to make the process of preference elicitation simpler and more ...
    • Article  

      Fatigue life prediction for a vessel sailing the North Atlantic route 

      Baxevani, Anastassia; Rychlik, I. (2007)
      A method for calculating the wave load induced fatigue damage accumulated by a vessel sailing along the North Atlantic route (NAr) is presented. This method is based on the Palmgren-Miner additive rule and the rainflow ...
    • Article  

      Graph theoretical structures in logic programs and default theories 

      Dimopoulos, Yannis; Torres, A. (1996)
      In this paper we present a graph representation of logic programs and default theories. We show that many of the semantics proposed for logic programs with negation can be expressed in terms of notions emerging from graph ...
    • Conference Object  

      Highly parallel model for object-oriented concurrent constraint programming 

      Banach, Richard; Papadopoulos, George Angelos (IEEE, 1995)
      Two of the currently most promising programming paradigms, namely Object-Oriented Programming and Concurrent Constraint Programming are combined into a single, highly parallel computational model based on Term Graph Rewriting ...
    • Article  

      Inference of gene relations from microarray data by abduction 

      Papatheodorou, I.; Kakas, Antonis C.; Sergot, M. (2005)
      We describe an application of Abductive Logic Programming (ALP) to the analysis of an important class of DNA microarray experiments. We develop an ALP theory that provides a simple and general model of how gene interactions ...
    • Article  

      The KGP model of agency 

      Kakas, Antonis C.; Mancarella, P.; Sadri, F.; Stathis, Kostas; Toni, F. (2004)
      This paper presents a new model of agency, called the KGP (Knowledge, Goals and Plan) model. This draws from the classic BDI model and proposes a hierarchical agent architecture with a highly modular structure that synthesises ...
    • Conference Object  

      The KGP model of agency for Global Computing: Computational model and prototype implementation 

      Bracciali, A.; Demetriou, Neophytos; Endriss, U.; Kakas, Antonis C.; Lu, W.; Mancarella, P.; Sadri, F.; Stathis, Kostas; Terreni, G.; Toni, F. (2005)
      We present the computational counterpart of the KGP (Knowledge, Goals, Plan) declarative model of agency for Global Computing. In this context, a computational entity is seen as an agent developed using Computational Logic ...
    • Article  

      Knowledge qualification through argumentation 

      Michael, Loizos; Kakas, Antonis C. (2009)
      We propose a framework that brings together two major forms of default reasoning in Artificial Intelligence: default property classification in static domains, and default property persistence in temporal domains. Emphasis ...
    • Article  

      Learning non-monotonic logic programs: Learning exceptions 

      Dimopoulos, Yannis; Kakas, Antonis C. (1995)
      In this paper we present a framework for learning non-monotonic logic programs. The method is parametric on a classical learning algorithm whose generated rules are to be understood as default rules. This means that these ...
    • Conference Object  

      Linear behaviour of term graph rewriting programs 

      Banach, Richard; Papadopoulos, George Angelos (ACM, 1995)
      The generalized term graph rewriting computational model is exploited to implement concurrent languages based on Girard's Linear Logic (LL). In particular a fragment of LL is identified which is able to serve as a `process ...
    • Article  

      Modelling and implementing asynchronous timed multimedia frameworks using coordination principles 

      Papadopoulos, George Angelos (2005)
      This paper combines work done in the areas of Artificial Intelligence, Multimedia Systems and Coordination Programming to derive a framework for Distributed Multimedia Systems based on asynchronous timed computations ...
    • Conference Object  

      Modelling inhibition in metabolic pathways through abduction and induction 

      Tamaddoni-Nezhad, A.; Kakas, Antonis C.; Muggleton, S.; Pazos, F. (2004)
      In this paper, we study how a logical form of scientific modelling that integrates together abduction and induction can be used to understand the functional class of unknown enzymes or inhibitors. We show how we can model, ...
    • Article  

      Modular-ε: An elaboration tolerant approach to the ramification and qualification problems 

      Kakas, Antonis C.; Michael, Loizos; Miller, R. (2005)
      We describe Modular-ε (Mε), a specialized, modeltheoretic logic for narrative reasoning about actions, able to represent non-deterministic domains involving concurrency, static laws (constraints) and indirect effects ...
    • Article  

      A multimedia programming model based on timed concurrent constraint programming 

      Papadopoulos, George Angelos (1998)
      We propose the development of multimedia programming frameworks based on the declarative logic programming setting and in particular the framework of object-oriented timed concurrent constraint programming (OO-TCCP). The ...
    • Article  

      On computing logic programs 

      Dimopoulos, Yannis (1996)
      In this paper we present and compare some classical problem-solving methods for computing the stable models of logic programs with negation. Using a graph theoretic representation of logic programs and their stable models, ...
    • Article  

      On the computational complexity of assumption-based argumentation for default reasoning 

      Dimopoulos, Yannis; Nebel, B.; Toni, F. (2002)
      Bondarenko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, the framework extends these formalisms ...
    • Article  

      On the semantics of abstract argumentation 

      Kakas, Antonis C.; Mancarella, P. (2013)
      Arguments need to be judged against other arguments. The decision to accept or reject an argument is generally a global decision that involves examining the same question for other arguments that oppose or can defend the ...