- Answer Sets for Propositional Theories
2005/01/01 by Paolo Ferraris · 1 citation
Computer Science · Mathematics · #Algebra over a field #Answer set programming #Antecedent (behavioral psychology) #Computer science #Denotational semantics #Discrete mathematics #Extension (predicate logic) #Intuitionistic logic #Logic programming #Logic, Reasoning, and Knowledge #Mathematics #Multi-Agent Systems and Negotiation #Operational semantics #Programming language #Propositional calculus #Pure mathematics #Semantic Web and Ontologies #Semantics (computer science) #Set (abstract data type) #Stable model semantics #Theoretical computer science #Well-founded semantics
- ASSAT: computing answer sets of a logic program by SAT solvers
2004/06/08 by Fangzhen Lin, Yuting Zhao · 1 citation
Computer Science · #Algorithm #Answer set programming #Circumscription #Computer science #Logic programming #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Multi-Agent Systems and Negotiation #Operational semantics #Programming language #Satisfiability #Semantics (computer science) #Solver #Stable model semantics #Theoretical computer science
- An abstract, argumentation-theoretic approach to default reasoning
1997/06/01 by A. Bondarenko, A. G. Bondarenko, Phan Minh Dũng +5 · 28 citations
Computer Science · Mathematics · #Answer set programming #Argumentation theory #Artificial intelligence #Autoepistemic logic #Circumscription #Computer science #Default logic #Defeasible estate #Defeasible reasoning #Denotational semantics #Description logic #Epistemology #Extension (predicate logic) #Logic programming #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Mathematical economics #Mathematics #Modal #Modal logic #Multi-Agent Systems and Negotiation #Multimodal logic #Non-monotonic logic #Operational semantics #Programming language #Semantics (computer science) #Set (abstract data type) #Stable model semantics #Theoretical computer science #Well-founded semantics
- A new logical characterisation of stable models and answer sets
1997/01/01 by David Pearce · 1 citation
Computer Science · #Answer set programming #Artificial intelligence #Autoepistemic logic #Circumscription #Computer science #Conservative extension #Constructive #Denotational semantics #Description logic #Extension (predicate logic) #Higher-order logic #Inference #Intuitionistic logic #Linear logic #Logic programming #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation #Multimodal logic #Non-monotonic logic #Operational semantics #Process (computing) #Programming language #Rule of inference #Semantic Web and Ontologies #Semantics (computer science) #Set (abstract data type) #Stable model semantics #Theoretical computer science #Well-founded semantics
- Classical negation in logic programs and disjunctive databases
1991/08/01 by Michael Gelfond, Vladimir Lifschitz · 6 citations
Computer Science · #Advanced Algebra and Logic #Artificial intelligence #Autoepistemic logic #Computer science #Datalog #Deductive database #Description logic #Knowledge representation and reasoning #Logic programming #Logic, Reasoning, and Knowledge #Multimodal logic #Negation #Negation as failure #Programming language #Semantic Web and Ontologies #Semantics (computer science) #Stable model semantics #Theoretical computer science