Over the past decade, a large number of deductive object-oriented database languages have been proposed. the earliest of these languages had few object-oriented features. and more and more features have systematically...
详细信息
ISBN:
(纸本)0769509967
Over the past decade, a large number of deductive object-oriented database languages have been proposed. the earliest of these languages had few object-oriented features. and more and more features have systematically been incorporated in successive languages. However a language with a clean logical semantics that naturally accounts for all the key object-oriented features, is still missing from the literature. Two features that are currently missing are the encapsulation of rule-based methods in classes, and non-monotonic behavioral inheritance with overriding, conflict resolution and blocking. this paper introduces the syntax of a language withthese features. It then defines a class of databases, called well-defined databases, that have an intuitive meaning and develops a direct logical semantics for this class of databases. the semantics is based on the well-founded semantics from logicprogramming. the work presented in this paper establishes a firm logical foundation for deductive object-oriented databases.
We present Branch-and-Check, a hybrid framework integrating Mixed Integer programming and Constraint logicprogramming, which encapsulates the traditional Benders Decomposition and Branch-and-Bound as special cases. I...
详细信息
Generalized logic programs. (GLP) are sets of rules with arbitrary quantifier free formulas in their bodies and ***-known program classes, such as definite, normal and disjunctive programs, are syntactically restricte...
ISBN:
(纸本)3540428631
Generalized logic programs. (GLP) are sets of rules with arbitrary quantifier free formulas in their bodies and ***-known program classes, such as definite, normal and disjunctive programs, are syntactically restricted special cases of GLP. Combining this program class withthe advantages of the additional use of constraints in the bodies of the rules results in the very expressive language C-GLP, appropriate to solve complex knowledge representation tasks.
the issue of knowledge sharing has been an important topic in multi-agent research. Knowledge sharing leads to that agents analyze, judge and synthesize the told information so as to make agents' own knowledge. To...
详细信息
ISBN:
(纸本)3540424946
the issue of knowledge sharing has been an important topic in multi-agent research. Knowledge sharing leads to that agents analyze, judge and synthesize the told information so as to make agents' own knowledge. To match these applications, this paper builds a logical framework for knowledge sharing among agents. We develop a multi-modal logic for reasoning about both agents' knowledge and told information. For formalizing the relationship between knowledge and told information, we present a framework of semantics, with respect to which a sound and complete proof theory is given.
作者：
Ringwelski, GeorgGMD FIRST
German National Research Center for Information Technology Kekuléstraße 7 Berlin12489 Germany
A Constraint Satisfaction Problem (CSP) is to find an assignment to a set of variables that is consistent wrt. a set of constraints over these variables. CSPs frequentlyarise in applications of distributed artificial ...
ISBN:
(纸本)3540428631
A Constraint Satisfaction Problem (CSP) is to find an assignment to a set of variables that is consistent wrt. a set of constraints over these variables. CSPs frequentlyarise in applications of distributed artificial intelligence [3] and may often not be solved bya centralized constraint solver for privacyor security reasons. In this distributed case (DCSP) constraints and variables are distributed among multiple automated agents.
A difficulty that arises frequently when writing a constraint solver is to determine the constraint propagation and simplification algorithm. In previous work, different methods for automatic generation of propagation...
详细信息
We investigate the relationship amongst some solutions to the frame problem. We encode Pednault's syntax-based solution [20], Baker's state-minimization policy [1], and Gelfond & Lifchitz's Action Lang...
详细信息
在线阅读本书 Book Description this book constitutes the refereed proceedings of the 8thinternationalconference on logic for programming, Artificial Intelligence, and reasoning, LPAR 2001, held in Havana, Cuba, in De...
详细信息
ISBN:
(纸本)9783540429579
在线阅读本书 Book Description this book constitutes the refereed proceedings of the 8thinternationalconference on logic for programming, Artificial Intelligence, and reasoning, LPAR 2001, held in Havana, Cuba, in December *** 40 revised full papers presented together with an invited paper were carefully reviewed and selected from 112 submissions. the book offers topical sections on verification, guarded logic, agents, automatedtheorem proving, non-classical logics, types, experimental aspects, foundations of logic, CSP and SAT, nonmonotonic reasoning, semantics, termination, knowledge-based systems, analysis of logic programs, databases and knowledge bases, and program analysis and proof planning. Book Dimension length: (cm)23.3 width:(cm)15.4
An intermediate-level specification notation, Logs, is presented for PRAM/BSP-style programming. It extends pre-post style semantics to reveal state at points of global synchronization before termination (if that occu...
详细信息
the proceedings contain 41 papers. the special focus in this conference is on Tools and Algorithms for the Construction and Analysis of Systems. the topics include: Language containment checking with nondeterministic ...
ISBN:
(纸本)3540418652
the proceedings contain 41 papers. the special focus in this conference is on Tools and Algorithms for the Construction and Analysis of Systems. the topics include: Language containment checking with nondeterministic BDDS;satisfiability checking using Boolean expression diagrams;automatic deductive verification with invisible invariants;a technique for invariant generation;model checking syllabi and student careers;parameterized verification of multithreaded software libraries;efficient guiding towards cost-optimality in UPPAAL;linear parametric model checking of timed automata;first passage time analysis of stochastic process algebra using partial orders;Boolean and Cartesian abstraction for model checking c programs;the loop compiler for java and JML;searching powerset automata by combining explicit-state and symbolic model checking;automated test generation from timed automata;testing an intentional naming scheme using genetic algorithms;building a tool for the analysis and testing of web applications;implementing a multi-valued symbolic model checker;a sweep-line method for state space exploration;compositional message sequence charts;an automata based interpretation of live sequence charts;coverage metrics for temporal logic model checking and the Erlang verification tool.
暂无评论