The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Relational queries computable in polynomial time
Information and Control
Readings in nonmonotonic reasoning
Handbook of theoretical computer science (vol. B)
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Logic in computer science: modelling and reasoning about systems
Logic in computer science: modelling and reasoning about systems
Synthesis of Communicating Processes from Temporal Logic Specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Information modeling and relational databases: from conceptual analysis to logical design
Information modeling and relational databases: from conceptual analysis to logical design
Synthesis of concurrent programs for an atomic read/write model of computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Static analysis in datalog extensions
Journal of the ACM (JACM)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Back and forth between guarded and modal logics
ACM Transactions on Computational Logic (TOCL)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Horn clauses and the fixpoint query hierarchy
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
Guarded fixed point logics and the monadic theory of countable trees
Theoretical Computer Science - Complexity and logic
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Decision procedures and expressiveness in the temporal logic of branching time
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Applications of intuitionistic logic in Answer Set Programming
Theory and Practice of Logic Programming
Diagnostic reasoning with A-Prolog
Theory and Practice of Logic Programming
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Guarded open answer set programming
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Nonmonotonic ontological and rule-based reasoning with extended conceptual logic programs
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Guarded open answer set programming with generalized literals
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Guarded hybrid knowledge bases12
Theory and Practice of Logic Programming
Quantified Equilibrium Logic and Foundations for Answer Set Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Hybrid Reasoning with Forest Logic Programs
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
FO(ID) as an Extension of DL with Rules
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
A Revised Concept of Safety for General Answer Set Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Complexity of the Stable Model Semantics for Queries on Incomplete Databases
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A Reasoner for Simple Conceptual Logic Programs
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
Quantified equilibrium logic and hybrid rules
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Tractable Reasoning with DL-Programs over Datalog-rewritable Description Logics
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
FO(ID) as an extension of DL with rules
Annals of Mathematics and Artificial Intelligence
A logical semantics for description logic programs
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Answer set programming's contributions to classical logic: an analysis of ASP methodology
Logic programming, knowledge representation, and nonmonotonic reasoning
Synonymous theories and knowledge representations in answer set programming
Journal of Computer and System Sciences
Hi-index | 0.00 |
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program's constants. We define a fixed-point logic (FPL) extension of Clark's completion such that open answer sets correspond to models of FPL formulas and identify a syntactic subclass of programs, called (loosely) guarded programs. Whereas reasoning with general programs in OASP is undecidable, the FPL translation of (loosely) guarded programs falls in the decidable (loosely) guarded fixed-point logic (μ(L)GF). Moreover, we reduce normal closed ASP to loosely guarded OASP, enabling, for the first time, a characterization of an answer set semantics by μLGF formulas. We further extend the open answer set semantics for programs with generalized literals. Such generalized programs (gPs) have interesting properties, for example, the ability to express infinity axioms. We restrict the syntax of gPs such that both rules and generalized literals are guarded. Via a translation to guarded fixed-point logic, we deduce 2-EXPTIME-completeness of satisfiability checking in such guarded gPs (GgPs). Bound GgPs are restricted GgPs with EXPTIME-complete satisfiability checking, but still sufficiently expressive to optimally simulate computation tree logic (CTL). We translate Datalog lite programs to GgPs, establishing equivalence of GgPs under an open answer set semantics, alternation-free μGF, and Datalog LITE.