On the complexity of propositional knowledge base revision, updates, and counterfactuals
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM Computing Surveys (CSUR)
Complexity aspects of various semantics for disjunctive databases
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bounds for the computational power and learning complexity of analog neural nets
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
New techniques for studying set languages, bag languages and aggregate functions
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semi-membership algorithms: some recent advances
ACM SIGACT News
NP trees and Carnap's modal logic
Journal of the ACM (JACM)
The reliability of queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The size of a revised knowledge base
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A formalization of the Turing test
ACM SIGART Bulletin
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Complexity of nonrecursive logic programs with complex values
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of query reliability
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Reducing query answering to satisfiability in nonmonotonic logics
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reconstructing the evolutionary history of natural languages
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Compilability and compact representations of revision of Horn knowledge bases
ACM Transactions on Computational Logic (TOCL)
Probabilistic logic programming with conditional constraints
ACM Transactions on Computational Logic (TOCL)
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Monotonic reductions, representative equivalence, and compilation of intractable problems
Journal of the ACM (JACM)
An analysis of formal inter-agent dialogues
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Theoretical Computer Science
On the algorithmic inversion of the discrete Radon transform
Theoretical Computer Science
Theoretical Computer Science
On scheduling send-graphs and receive-graphs under the LogP-model
Information Processing Letters
Programming with non-determinism in deductive databases
Annals of Mathematics and Artificial Intelligence
"Possible is certain'' is desirable and can be expressive
Annals of Mathematics and Artificial Intelligence
On non-determinism in machines and languages
Annals of Mathematics and Artificial Intelligence
Nonmonotonic reasoning: from complexity to algorithms
Annals of Mathematics and Artificial Intelligence
Probabilistic Default Reasoning with Conditional Constraints
Annals of Mathematics and Artificial Intelligence
Computational Complexity of Simultaneous Elementary Matching Problems
Journal of Automated Reasoning
Single Step Tableaux for Modal Logics
Journal of Automated Reasoning
Reasoning about Minimal Knowledge in Nonmonotonic Modal Logics
Journal of Logic, Language and Information
A Logic with Relative Knowledge Operators
Journal of Logic, Language and Information
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
Computational properties of metaquerying problems
ACM Transactions on Computational Logic (TOCL)
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
Theoretical Computer Science
Complexity results for structure-based causality
Artificial Intelligence
On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Structural Complexity and Neural Networks
WIRN VIETRI 2002 Proceedings of the 13th Italian Workshop on Neural Nets-Revised Papers
Search and Optimization Problems in Datalog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Propositional Lower Bounds: Generalization and Algorithms
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
On the Complexity of Model Checking and Inference in Minimal Models
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Generalized Quantifiers in Logic Programs
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
A Generalized Quantifier Concept in Computational Complexity Theory
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
Design and Results of the Tableaux-99 Non-classical (Modal) Systems Comparison
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Generalized Default Logic: Minimal Knowledge, Autoepistemic and Default Reasoning Reconciled
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Issues in the Design of Negotiation Protocols for Logic-Based Agent Communication Languages
Agent-Mediated Electronic Commerce III, Current Issues in Agent-Based Electronic Commerce Systems (includes revised papers from AMEC 2000 Workshop)
Dominance Constraints: Algorithms and Complexity
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Bounded size dictionary compression: SCk -completeness and NC algorithms
Information and Computation
Preprocessing of intractable problems
Information and Computation
The complexity of XPath query evaluation
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
New Generation Computing
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
McNaughton families of languages
Theoretical Computer Science
Hardness of Approximating the Minimum Distance of a Linear Code
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Pure Nash equilibria: hard and easy games
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Complexity of some problems in positive and related calculi
Theoretical Computer Science - Logic and complexity in computer science
The description logic handbook
Fundamenta Informaticae - Concurrency specification and programming
Theoretical Computer Science
Proceedings of the 2004 ACM symposium on Applied computing
Optimal Models of Disjunctive Logic Programs: Semantics, Complexity, and Computation
IEEE Transactions on Knowledge and Data Engineering
Precise interprocedural dependence analysis of parallel programs
Theoretical Computer Science
Complexity results for explanations in the structural-model approach
Artificial Intelligence
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
Declarative semantics for active rules
Theory and Practice of Logic Programming
A PTIME-complete matching problem for SLP-compressed words
Information Processing Letters
On the computational complexity of qualitative coalitional games
Artificial Intelligence
Extension and Equivalence Problems for Clause Minimal Formulae
Annals of Mathematics and Artificial Intelligence
Weighted hypertree decompositions and optimal query plans
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity of propositional nested circumscription and nested abnormality theories
ACM Transactions on Computational Logic (TOCL)
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
On the complexity of nonrecursive XQuery and functional query languages on complex values
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query answering exploiting structural properties
ACM SIGMOD Record
The complexity of model checking for propositional default logics
Data & Knowledge Engineering
New tractable classes for default reasoning from conditional knowledge bases
Annals of Mathematics and Artificial Intelligence
Probabilistic logic under coherence: complexity and algorithms
Annals of Mathematics and Artificial Intelligence
Weak nonmonotonic probabilistic logics
Artificial Intelligence
Processing queries on tree-structured data efficiently
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the computational complexity of coalitional resource games
Artificial Intelligence
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
Compilability of propositional abduction
ACM Transactions on Computational Logic (TOCL)
On the complexity of nonrecursive XQuery and functional query languages on complex values
ACM Transactions on Database Systems (TODS)
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
Weighted hypertree decompositions and optimal query plans
Journal of Computer and System Sciences
International Journal of Approximate Reasoning
The Compactness of Belief Revision and Update Operators
Fundamenta Informaticae
Magic Sets and their application to data integration
Journal of Computer and System Sciences
On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
Proceedings of the 8th ACM conference on Electronic commerce
A split-combination approach to merging knowledge bases in possibilistic logic
Annals of Mathematics and Artificial Intelligence
On computing all abductive explanations from a propositional Horn theory
Journal of the ACM (JACM)
Variable-strength conditional preferences for ranking objects in ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Outlier detection by logic programming
ACM Transactions on Computational Logic (TOCL)
The computational complexity of choice sets
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Expressive probabilistic description logics
Artificial Intelligence
Complexity results for answer set programming with bounded predicate arities and implications
Annals of Mathematics and Artificial Intelligence
Combining answer set programming with description logics for the Semantic Web
Artificial Intelligence
Typechecking top-down XML transformations: Fixed input or output schemas
Information and Computation
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Outlier detection using default reasoning
Artificial Intelligence
ACM Computing Surveys (CSUR)
Finding informative commonalities in concept collections
Proceedings of the 17th ACM conference on Information and knowledge management
Symmetries and the complexity of pure Nash equilibrium
Journal of Computer and System Sciences
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
Strategic Agent Communication: An Argumentation-Driven Approach
Declarative Agent Languages and Technologies VI
A compositional framework for complex queries over uncertain data
Proceedings of the 12th International Conference on Database Theory
New NP-Complete Problems Associated with Lattices
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
Fundamenta Informaticae - Machines, Computations and Universality, Part II
The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Resolving Conflicts in Action Descriptions
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
On the complexity of constrained Nash equilibria in graphical games
Theoretical Computer Science
Computational aspects of covering in dominance graphs
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Efficient datalog abduction through bounded treewidth
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
From XQuery to relational logics
ACM Transactions on Database Systems (TODS)
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
On polynomial sized MDP succinct policies
Journal of Artificial Intelligence Research
Responsibility and blame: a structural-model approach
Journal of Artificial Intelligence Research
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Semantical and computational aspects of horn approximations
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
The complexity of belief update
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Model checking for nonmonotonic logics: algorithms and complexity
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Diagnosers and diagnosability of succinct transition systems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Semantics and complexity of abduction from default theories
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
On the computational complexity of coalitional resource games
Artificial Intelligence
Weak nonmonotonic probabilistic logics
Artificial Intelligence
The computational complexity of ideal semantics
Artificial Intelligence
Tractable database design and datalog abduction through bounded treewidth
Information Systems
A probabilistic approach to navigation in Hypertext
Information Sciences: an International Journal
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Complexity theory made easy: the formal language approach to the definition of complexity classes
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Oracle circuits for branching-time model checking
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Symmetries and the complexity of pure Nash equilibrium
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Arithmetizing classes around NC1and L
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Complexity of some problems in universal algebra extended abstract
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
Qualitative spatial reasoning with topological information
Qualitative spatial reasoning with topological information
Incremental query evaluation in a ring of databases
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Reasoning with minimal belief and negation as failure: algorithms and complexity
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Algorithms and theory of computation handbook
Parallel computation: models and complexity issues
Algorithms and theory of computation handbook
A comparison of merging operators in possibilistic logic
KSEM'10 Proceedings of the 4th international conference on Knowledge science, engineering and management
Non-transferable utility coalitional games via mixed-integer linear constraints
Journal of Artificial Intelligence Research
The complexity of model checking for belief revision and update
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
The impact of virtual views on containment
Proceedings of the VLDB Endowment
Determining relevance of accesses at runtime
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of core, kernel, and bargaining set
Artificial Intelligence
Detecting and repairing anomalous evolutions in noisy environments
Annals of Mathematics and Artificial Intelligence
Partial solutions with unique completion
Reasoning, Action and Interaction in AI Theories and Systems
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
On the combination of logical and probabilistic models for information analysis
Applied Intelligence
Implementation and experimentation of the logic language NP Datalog
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Attribute value reordering for efficient hybrid OLAP
Information Sciences: an International Journal
Tests for Permutation Functions
Finite Fields and Their Applications
FPT suspects and tough customers: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
Fundamenta Informaticae - Machines, Computations and Universality, Part II
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Single-player Monte-Carlo tree search for SameGame
Knowledge-Based Systems
The Compactness of Belief Revision and Update Operators
Fundamenta Informaticae
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
Communicative commitments: Model checking and complexity analysis
Knowledge-Based Systems
Well-Founded Semantics for Default Logic
Fundamenta Informaticae
Queries and Algorithms Computable by Polynomial Time Existential Reflective Machines
Fundamenta Informaticae
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
Fundamenta Informaticae
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
The complexity of one-agent refinement modal logic
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
On efficient algorithms for SAT
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
Complexity of counting output patterns of logic circuits
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Making queries tractable on big data with preprocessing: through the eyes of complexity theory
Proceedings of the VLDB Endowment
The complexity of one-agent refinement modal logic (extended abstract)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
Computational Complexity
| Hi-index | 0.02 |