Results 1  10
of
349
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 578 (50 self)
 Add to MetaCart
in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a calculus on computation trees over realnumbered time. Unfortunately
Index sets for Finite Normal Predicate Logic Programs
, 2012
"... Let L be a computable first order predicate language with infinitely many constant symbols and infinitely many nary predicate symbols and nary functions symbols for all n ≥ 1 and let Q0,Q1,... be an effective list all the finite normal predicate logic programs over L. Given some property P of fini ..."
Abstract
 Add to MetaCart
Let L be a computable first order predicate language with infinitely many constant symbols and infinitely many nary predicate symbols and nary functions symbols for all n ≥ 1 and let Q0,Q1,... be an effective list all the finite normal predicate logic programs over L. Given some property P
Predicate Abstraction with Indexed Predicates
, 2007
"... Predicate abstraction provides a powerful tool for verifying properties of infinitestate systems using a combination of a decision procedure for a subset of firstorder logic and symbolic methods originally developed for finitestate model checking. We consider models containing firstorder state v ..."
Abstract

Cited by 31 (1 self)
 Add to MetaCart
Predicate abstraction provides a powerful tool for verifying properties of infinitestate systems using a combination of a decision procedure for a subset of firstorder logic and symbolic methods originally developed for finitestate model checking. We consider models containing firstorder state
F.ANCESCO Normal Predicative Logics
"... Absiraet. in this work we extend results from [4], [3] and [2] about propositional calculi with graded modalities to the predicative level. Our semantic is based on Kripke models with a single domain of interpretation for all the worlds. Therefore the axiomatic system will need a suitable generaliza ..."
Abstract
 Add to MetaCart
with graded modalities 22 consists of.' a) a denumerable set of individual variables Var = {xl, x2,...}; b) a finite or denumerable nonempty set of predicative symbols P ~ (n, j> 1); c) a finite or denumerable, possibly empty, set of function symbols f7 (n, j> 1); d) a finite or denumerable
Magic Templates: A Spellbinding Approach to Logic Programs
 Journal of Logic Programming
, 1988
"... We consider a bottomup queryevaluation scheme in which facts of relations are allowed to have nonground terms. The Magic Sets queryrewriting technique is generalized to allow arguments of predicates to be treated as bound even though the rules do not provide ground bindings for those arguments. I ..."
Abstract

Cited by 127 (14 self)
 Add to MetaCart
. In particular, we regard as "bound" any argument containing a function symbol or a variable that appears more than once in the argument list. Generalized "magic " predicates are thus defined to compute the set of all goals reached in a topdown exploration of the rules, starting from a given
Towards Predicate Answer Set Programming via Coinductive Logic Programming
"... Abstract Answer Set Programming (ASP) is a powerful paradigm based on logic programming for nonmonotonic reasoning. Current ASP implementations are restricted to "grounded rangerestricted functionfree normal programs" and use an evaluation strategy that is "bottomup" (i.e., ..."
Abstract
 Add to MetaCart
Abstract Answer Set Programming (ASP) is a powerful paradigm based on logic programming for nonmonotonic reasoning. Current ASP implementations are restricted to "grounded rangerestricted functionfree normal programs" and use an evaluation strategy that is "bottomup" (i
Bidirectional Answer Set Programs with Function Symbols
, 2009
"... Current Answer Set Programming (ASP) solvers largely build on logic programming without function symbols. This limitation makes ASP decidable, but greatly complicates the modeling of indefinite time, recursive data structures (e.g., lists), and infinite processes and objects in general. Recent resea ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Current Answer Set Programming (ASP) solvers largely build on logic programming without function symbols. This limitation makes ASP decidable, but greatly complicates the modeling of indefinite time, recursive data structures (e.g., lists), and infinite processes and objects in general. Recent
Logic programming
"... Indexing is generally viewed as an implementation artifact, indispensable to speed up the execution of logic programs and theorem provers, but with little intrinsically logical about it. We show that indexing can be given a justification in proof theory on the basis of focusing and linearity. We dem ..."
Abstract
 Add to MetaCart
demonstrate this approach on predicate indexing for Horn clauses and several formulations of hereditary Harrop formulas. We also show how to refine this approach to discriminate on function symbols as well.
A DavisPutnam Program and its Application to Finite FirstOrder Model Search: Quasigroup Existence Problems
, 1994
"... This document describes the implementation and use of a DavisPutnam procedure for the propositional satisfiability problem. It also describes code that takes statements in firstorder logic with equality and a domain size n searches for models of size n. The firstorder modelsearching code transfor ..."
Abstract

Cited by 107 (10 self)
 Add to MetaCart
of the firstorder statements. The firstorder modelsearching program accepts statements only in a flattened relational clause form without function symbols. Additional code was written to take input statements in the language of Otter 3.0 [5] and produce the flattened relational form. The program
A Logic Programming Approach To Manipulating Formulas And Programs
 IEEE Symp. Logic Programming
, 1994
"... : Firstorder Horn clause logic can be extended to a higherorder setting in which function and predicate symbols can be variables and terms are replaced with simply typed terms. For such a logic programming language to be complete in principle, it must incorporate higherorder unification. Althoug ..."
Abstract

Cited by 56 (17 self)
 Add to MetaCart
: Firstorder Horn clause logic can be extended to a higherorder setting in which function and predicate symbols can be variables and terms are replaced with simply typed terms. For such a logic programming language to be complete in principle, it must incorporate higherorder unification
Results 1  10
of
349