Results 1  10
of
23
The CIFF Proof Procedure for Abductive Logic Programming with Constraints
 In Proceedings JELIA04
, 2004
"... We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abductive reasoning with constraint solving and by relaxing the restrictions on allowed inputs for which the procedure can operate ..."
Abstract

Cited by 37 (18 self)
 Add to MetaCart
We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abductive reasoning with constraint solving and by relaxing the restrictions on allowed inputs for which the procedure can operate correctly. An implementation of our proof procedure is available and has been applied successfully in the context of multiagent systems.
Unrestricted vs restricted cut in a tableau method for Boolean circuits
 In: AI&M 2004, 8th International Symposium on Artificial Intelligence and Mathematics
, 2005
"... This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in several natural ways. The results show that the unrestricted cut rule can be exponentially more effective than any of th ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
(Show Context)
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in several natural ways. The results show that the unrestricted cut rule can be exponentially more effective than any of the considered restrictions. Moreover, there are exponential differences between the restricted versions, too. The results also apply to the DavisPutnam procedure for conjunctive normal form formulae obtained from Boolean circuits with a standard linear size translation.
A Taxonomy of Parallel Strategies for Deduction
 Annals of Mathematics and Artificial Intelligence
, 1999
"... This paper presents a taxonomy of parallel theoremproving methods based on the control of search (e.g., masterslaves versus peer processes), the granularity of parallelism (e.g., fine, medium and coarse grain) and the nature of the method (e.g., orderingbased versus subgoalreduction) . We anal ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
(Show Context)
This paper presents a taxonomy of parallel theoremproving methods based on the control of search (e.g., masterslaves versus peer processes), the granularity of parallelism (e.g., fine, medium and coarse grain) and the nature of the method (e.g., orderingbased versus subgoalreduction) . We analyze how the di#erent approaches to parallelization a#ect the control of search: while fine and mediumgrain methods, as well as masterslaves methods, generally do not modify the sequential search plan, parallelsearch methods may combine sequential search plans (multisearch) or extend the search plan with the capability of subdividing the search space (distributed search). Precisely because the search plan is modified, the latter methods may produce radically di#erent searches than their sequential base, as exemplified by the first distributed proof of the Robbins theorem generated by the Modified ClauseDi#usion prover Peersmcd. An overview of the state of the field and directions...
Comirit: Commonsense Reasoning by Integrating Simulation and Logic
"... Abstract. Rich computer simulations or quantitative models can enable an agent to realistically predict realworld behavior with precision and performance that is difficult to emulate in logical formalisms. Unfortunately, such simulations lack the deductive flexibility of techniques such as formal l ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
(Show Context)
Abstract. Rich computer simulations or quantitative models can enable an agent to realistically predict realworld behavior with precision and performance that is difficult to emulate in logical formalisms. Unfortunately, such simulations lack the deductive flexibility of techniques such as formal logics and so do not find natural
Propositional interval neighborhood temporal logics
 Journal of Universal Computer Science
, 2003
"... Abstract: Logics for time intervals provide a natural framework for dealing with time in various areas of computer science and artificial intelligence, such as planning, natural language processing, temporal databases, and formal specification. In this paper we focus our attention on propositional i ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
(Show Context)
Abstract: Logics for time intervals provide a natural framework for dealing with time in various areas of computer science and artificial intelligence, such as planning, natural language processing, temporal databases, and formal specification. In this paper we focus our attention on propositional interval temporal logics with temporal modalities for neighboring intervals over linear orders. We study the class of propositional neighborhood logics (PNL) over two natural semantics, respectively admitting and excluding pointintervals. First, we introduce interval neighborhood frames and we provide representation theorems for them; then, we develop complete axiomatic systems and semantic tableaux for logics in PNL.
Automated Synthesis of Tableau Calculi
"... Abstract This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau inference rules which can then be used to reason within the logic. The method guarantees that the generated rules ..."
Abstract

Cited by 7 (7 self)
 Add to MetaCart
Abstract This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau inference rules which can then be used to reason within the logic. The method guarantees that the generated rules form a calculus which is sound and constructively complete. If the logic can be shown to admit finite filtration with respect to a welldefined firstorder semantics then adding a general blocking mechanism produces a terminating tableau calculus. The process of generating tableau rules can be completely automated and produces, together with the blocking mechanism, an automated procedure for generating tableau decision procedures. For illustration we show the workability of the approach for propositional intuitionistic logic. 1
Efficient query processing with compiled knowledge bases
 Proceedings of the International Conference TABLEAUX 2005 – Analytic Tableaux and Related Methods
, 2005
"... Abstract. The goal of knowledge compilation is to enable fast queries. Prior approaches had the goal of small (i.e., polynomial in the size of the initial knowledge bases) compiled knowledge bases. Typically, queryresponse time is linear, so that the efficiency of querying the compiled knowledge ba ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. The goal of knowledge compilation is to enable fast queries. Prior approaches had the goal of small (i.e., polynomial in the size of the initial knowledge bases) compiled knowledge bases. Typically, queryresponse time is linear, so that the efficiency of querying the compiled knowledge base depends on its size. In this paper, a target for knowledge compilation called the ritrie is introduced; it has the property that even if they are large they nevertheless admit fast queries. Specifically, a query can be processed in time linear in the size of the query regardless of the size of the compiled knowledge base. 1
Efficient Query Processing with Reduced Implicate Tries
, 2007
"... The goal of knowledge compilation is to enable fast queries. Prior approaches had the goal of small (i.e., polynomial in the size of the initial knowledge bases) compiled knowledge bases. Typically, queryresponse time is linear, so that the efficiency of querying the compiled knowledge base depends ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
The goal of knowledge compilation is to enable fast queries. Prior approaches had the goal of small (i.e., polynomial in the size of the initial knowledge bases) compiled knowledge bases. Typically, queryresponse time is linear, so that the efficiency of querying the compiled knowledge base depends on its size. In this paper, a target for knowledge compilation called the ritrie is introduced; it has the property that even if they are large they nevertheless admit fast queries. Specifically, a query can be processed in time linear in the size of the query regardless of the size of the compiled knowledge base.
Tableaux, Path Dissolution, and Decomposable Negation Normal Form for Knowledge Compilation
"... Decomposable negation normal form (DNNF) was developed primarily for knowledge compilation. Formulas in DNNF are linkless, in negation normal form (NNF), and have the property that atoms are not shared across conjunctions. Full dissolvents are linkless NNF formulas that do not in general have the la ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Decomposable negation normal form (DNNF) was developed primarily for knowledge compilation. Formulas in DNNF are linkless, in negation normal form (NNF), and have the property that atoms are not shared across conjunctions. Full dissolvents are linkless NNF formulas that do not in general have the latter property. However, many of the applications of DNNF can be obtained with full dissolvents. Two additional methods — regular tableaux and semantic factoring — are shown to produce equivalent DNNF. A class of formulas is presented on which earlier DNNF conversion techniques are necessarily exponential; path dissolution and semantic factoring handle these formulas in linear time.